|
Search: id:A123137
|
|
|
| A123137 |
|
a(n) = a(n-1)^2 + Sum of the digits of a(n-1), with a(1)=1. |
|
+0
1
|
|
| 1, 2, 6, 42, 1770, 3132915, 9815156397249, 96337295102457969494768070, 9280874427658072275134580545332124401295103091525032, 86134630141957550628261532252390058231417831318795074704890644033088478051503964693639295413423482601219
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
A. Frank & P. Jacqueroux, International Contest, 2001. Item 28
|
|
EXAMPLE
|
a(5) = 42^2 + (4 + 2) = 1770
|
|
PROGRAM
|
(PARI) a=1; for(n=1, 11, print1(a, ", "); sda=eval(Vec(Str(a))); a=a^2+sum(i=1, length(sda), sda[i]))
|
|
CROSSREFS
|
Sequence in context: A116896 A061062 A115961 this_sequence A014117 A054377 A007018
Adjacent sequences: A123134 A123135 A123136 this_sequence A123138 A123139 A123140
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Herman Jamke (hermanjamke(AT)fastmail.fm), Sep 30 2006
|
|
|
Search completed in 0.002 seconds
|
