|
| |
|
|
A117061
|
|
Numbers n such that a(n)=(s(n-1))^2+n, with a(1)=1.
|
|
0
| |
|
|
1, 3, 12, 13, 21, 15, 43, 57, 153, 91, 111, 21, 22, 30, 24, 52, 66, 162, 100, 21, 30, 31, 39, 168, 250, 75, 171, 109, 129, 174, 175, 201, 42, 70, 84, 180, 118, 138, 183, 184, 210, 51, 79, 300, 54, 127, 147, 192, 193, 219, 195, 277, 309, 198, 379, 417, 201, 67, 228, 204
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| From a puzzle : 1 3 12 13 21 15 43 .?. 153 answer : 57 Each number can be found by squaring the sum of the digits of the previous number and then adding the indexnumber.
|
|
|
FORMULA
| a(n)= s(n-1))^2+n, where s(n) stands for the sum of the digits of a(n)
|
|
|
CROSSREFS
| Sequence in context: A024546 A073542 A063444 * A089919 A176796 A032918
Adjacent sequences: A117058 A117059 A117060 * A117062 A117063 A117064
|
|
|
KEYWORD
| base,easy,nonn
|
|
|
AUTHOR
| Luc Stevens (lms022(AT)yahoo.com), Apr 16 2006
|
| |
|
|
