|
Search: id:A121383
|
|
|
| A121383 |
|
a(0)=3. a(n) = number of earlier terms which, each added to n, sum to a square. |
|
+0
1
|
|
| 3, 1, 0, 0, 0, 0, 1, 0, 2, 5, 0, 1, 0, 1, 1, 5, 7, 0, 1, 0, 2, 0, 1, 2, 7, 10, 1, 0, 0, 2, 0, 2, 0, 0, 2, 0, 1, 6, 8, 16
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Does every nonnegative integer occur eventually? Analogous to A123396 a(0)=0. a(n) = number of earlier terms each of which, when added to n, the sum is a triangular number.
|
|
EXAMPLE
|
a(6) = 1 because a(0) + 6 = 3 + 6 = 9 = 3^2.
a(20) = 2 because a(9) + 20 = a(15) + 20 = 25 = 5^2.
a(26) = 1 because a(25) + 26 = 10 + 26 = 36 = 6^2.
|
|
CROSSREFS
|
Cf. A123396.
Sequence in context: A087345 A140334 A078529 this_sequence A059530 A049828 A058612
Adjacent sequences: A121380 A121381 A121382 this_sequence A121384 A121385 A121386
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jonathan Vos Post (jvospost3(AT)gmail.com), Oct 14 2006
|
|
|
Search completed in 0.002 seconds
|
