This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A140131 a(n)=a(n-1)+a(n-2)+Sum_digits[a(n-1)]+Sum_digits[a(n-2)], with a(0)=0 and a(1)=1. 2
 0, 1, 2, 6, 16, 35, 66, 121, 203, 333, 550, 902, 1473, 2401, 3896, 6330, 10264, 16619, 26919, 43588, 70562, 114198, 184804, 299051, 483906, 783013, 1266971, 2050038, 3317059, 5367143, 8684259, 14051473, 22735799, 36787341, 59523223, 96310634 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Harvey P. Dale, Table of n, a(n) for n = 0..1000 MAPLE P:=proc(n) local a, b, c, i, k, w, x; a:=0; b:=1; print(a); print(b); for i from 1 by 1 to n do w:=0; k:=a; while k>0 do w:=w+k-(trunc(k/10)*10); k:=trunc(k/10); od; x:=0; k:=b; while k>0 do x:=x+k-(trunc(k/10)*10); k:=trunc(k/10); od; c:=b; b:=a+b+w+x; a:=c; print(b); od; end: P(100); MATHEMATICA nxt[{a_, b_}]:=a+b+Total[IntegerDigits[a]]+Total[IntegerDigits[b]]; Transpose[NestList[{Last[#], nxt[#]}&, {0, 1}, 40]][[1]] (* From Harvey P. Dale, Oct 31 2011 *) CROSSREFS Cf. A016052, A047892, A047897-A047900, A047902, A047903, A055263, A134268, A135210, A140132. Sequence in context: A192706 A199477 A060354 * A159938 A145126 A005676 Adjacent sequences:  A140128 A140129 A140130 * A140132 A140133 A140134 KEYWORD easy,nonn,base AUTHOR Paolo P. Lava and Giorgio Balzarotti, May 09 2008 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .