|
Search: id:A154562
|
|
|
| A154562 |
|
Positive integers n such that the sum of the squares of all the substring decompositions of n is a multiple of n. |
|
+0
1
|
|
| 1, 2, 3, 4, 5, 6, 7, 8, 9, 101, 202, 233, 303, 351, 404, 427, 466, 505, 606, 699, 707, 808, 909, 1252, 2068, 5050, 10001, 19247, 20002, 30003, 40004, 50005, 60006, 70007, 80008, 90009, 319519, 500050
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
No other term, between 500051 and 1000000, but integers such as 1000001, 2000002, 3000003, ..., or 50000050 will be in the sequence.
|
|
EXAMPLE
|
Example : 101 is in the sequence, because 0^2 + 1^2 + 10^2 + 101^2 = 10302 = 102*101
Example : 351 is in the sequence, because 1^2 + 3^2 + 5^2 + 35^2 + 51^2 + 351^2 = 127062 = 362*351
|
|
CROSSREFS
|
Sequence in context: A071275 A050783 A030147 this_sequence A077726 A061479 A028431
Adjacent sequences: A154559 A154560 A154561 this_sequence A154563 A154564 A154565
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Jean-Marc Falcoz (jeanmarcfalcoz(AT)vtxnet.ch), Jan 12 2009
|
|
|
Search completed in 0.002 seconds
|
