|
| |
|
|
A112638
|
|
Power each digit individually according to its position and add the numbers.
|
|
0
|
|
|
|
2, 4, 16, 46, 196, 946, 8296, 65246, 385596, 1568346, 3925096, 17165846, 59491596, 333414346, 1000627096, 1003689846, 1013327596, 1019992346, 1099915096, 1899135846, 8291221596, 65211444346, 385412777096, 1566619439846, 3899692777596
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
As the sequence tends to infinity the position of the units is always 6. The position of 10 is 4 or 9. And so on.
|
|
|
LINKS
|
Table of n, a(n) for n=1..25.
|
|
|
EXAMPLE
|
a(1)= 2
a(2)= 2^2 = 4
a(3)= 4^2 = 16
a(4)= 1^2 *10 + 6^2 = 10 + 36 = 46
a(5)= 4^2 *10 + 6^2 = 160 + 36 = 196
a(6)= 1^2 *100 + 9^2 *10 + 6^2 = 100 + 810 +36 = 946
|
|
|
PROG
|
(PARI) modN(n) = { local(resul, nshif, d) ; nshif = n; d = 0 ; resul = 0 ; while(nshif > 0, resul += 10^d* ((nshif % 10)^2) ; d++ ; nshif = floor(nshif/10) ; ) ; return(resul) ; } { an=2 ; print(an, ", ") ; for (n = 2, 30, an=modN(an) ; print(an, ", ") ; ) } - R. J. Mathar, Mar 15 2006
|
|
|
CROSSREFS
|
Sequence in context: A148279 A101061 A148280 * A077162 A128903 A103435
Adjacent sequences: A112635 A112636 A112637 * A112639 A112640 A112641
|
|
|
KEYWORD
|
nonn,base
|
|
|
AUTHOR
|
Jorge Coveiro, Dec 27 2005
|
|
|
EXTENSIONS
|
More terms from R. J. Mathar, Mar 15 2006
|
|
|
STATUS
|
approved
|
| |
|
|
