Your task
Given a integer input, \$ n \$ (such that \$ n > 1 \$), decide whether it can be written as the sum of (at least 2) consecutive square numbers.
Test cases
Truthy:
Input Explanation
5 1 + 4
13 4 + 9
14 1 + 4 + 9
25 9 + 16
29 4 + 9 + 16
30 1 + 4 + 9 + 16
41 16 + 25
50 9 + 16 + 25
Falsy:
(Any number from 2 to 50 that's not in the truthy test cases)
Clarifications and notes
For reference, here is an ungolfed Python program which will get all the truthy values up to 100.
This is OEIS A174069
This is code-golf, so shortest answer in bytes wins!
lambda x:x in(5,13,14,25,29,30,41,50)
but it's not even short :') \$\endgroup\$