The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 2
 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; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS 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: A222185 A265774 A100697 * A322209 A088798 A027272 Adjacent sequences:  A134265 A134266 A134267 * A134269 A134270 A134271 KEYWORD easy,nonn,base AUTHOR Paolo P. Lava and Giorgio Balzarotti, Jan 30 2008 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 6 16:34 EDT 2020. Contains 334828 sequences. (Running on oeis4.)