|
Search: id:A134268
|
|
|
| A134268 |
|
a(n+2) = sum_digits[a(n+1)] + sum_digits[a(n)] + sum_digits[a(n+1)]*sum_digits[a(n)], with a(0)=0, a(1)=1. |
|
+0
3
|
|
| 0, 1, 3, 19, 54, 109, 120, 55, 153, 109, 120, 55, 153, 109, 120, 55, 153, 109, 120, 55, 153, 109, 120, 55, 153, 109, 120, 55, 153, 109, 120, 55, 153, 109, 120, 55, 153, 109, 120, 55, 153, 109, 120, 55, 153, 109, 120, 55, 153, 109, 120, 55, 153, 109, 120, 55, 153
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
MAPLE
|
P:=proc(n)local a0, a1, i, k, w, x; a0:=0; a1:=1; print(a0); print(a1); for i from 1 by 1 to n do w:=0; k:=a0+a1; while k>0 do w:=w+k-(trunc(k/10)*10); k:=trunc(k/10); od; x:=0; k:=a1; while k>0 do x:=x+k-(trunc(k/10)*10); k:=trunc(k/10); od; a0:=a1; a1:=w+x+w*x; print(a1); od; end: P(100);
|
|
CROSSREFS
|
Cf. A010077.
Sequence in context: A054697 A112627 A100697 this_sequence A088798 A027272 A106875
Adjacent sequences: A134265 A134266 A134267 this_sequence A134269 A134270 A134271
|
|
KEYWORD
|
easy,nonn,base
|
|
AUTHOR
|
Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Jan 30 2008
|
|
|
Search completed in 0.002 seconds
|
