Statements (31)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
integer sequence
|
| gptkbp:author |
gptkb:N._J._A._Sloane
|
| gptkbp:citation |
OEIS:A000290
OEIS:A000415 OEIS:A001156 OEIS:A001972 OEIS:A005875 |
| gptkbp:first_terms |
1
14 1596 188 36 4 812 398 84 3044 |
| gptkbp:form |
a(n) = number of ordered quadruples (a,b,c,d) such that a^2 + b^2 + c^2 + d^2 = n, a,b,c,d >= 0
|
| gptkbp:hasKeyword |
easy
nice nonn |
| gptkbp:hasOEISId |
gptkb:A006577
|
| https://www.w3.org/2000/01/rdf-schema#label |
OEIS:A006577
|
| gptkbp:OEIS |
true
https://oeis.org/A006577 |
| gptkbp:offset |
0,2
|
| gptkbp:relatedTo |
sum of squares
|
| gptkbp:sequence |
nonnegative integers
Number of ways of writing n as a sum of 1, 2, 3, or 4 squares, order of summands matters |
| gptkbp:bfsParent |
gptkb:3x+1_problem
|
| gptkbp:bfsLayer |
8
|