A065076 a(0) = 0, a(1) = 1, a(n) = (sum of digits of a(n-1)) + a(n-2).

0, 1, 1, 2, 3, 5, 8, 13, 12, 16, 19, 26, 27, 35, 35, 43, 42, 49, 55, 59, 69, 74, 80, 82, 90, 91, 100, 92, 111, 95, 125, 103, 129, 115, 136, 125, 144, 134, 152, 142, 159, 157, 172, 167, 186, 182, 197, 199, 216, 208, 226, 218, 237, 230, 242, 238, 255, 250, 262, 260, 270

Offset: 0

Author

Bodo Zinser, Nov 09 2001

Keywords

• nonn
• base
• easy

Examples

			a(8) = 12 because a(7) = 13, a(6) = 8 and 4 = 1+3 and 12 = 4 + 8.
		

Links

• Harry J. Smith, Table of n, a(n) for n = 0..1000

Crossrefs

Cf. A007953 and A007612.

Cf. A030132.

Programs

Haskell

a065076 n = a065076_list !! n
a065076_list = 0 : 1 : zipWith (+)
                a065076_list (map a007953 $ tail a065076_list)
-- Reinhard Zumkeller, Nov 13 2014

Mathematica

a[0] = 0; a[1] = 1; a[n_] := a[n] = Apply[ Plus, IntegerDigits[ a[n - 1] ]] + a[n - 2]; Table[ a[n], {n, 0, 100} ]
Transpose[NestList[{Last[#],Total[IntegerDigits[Last[#]]]+First[#]}&, {0,1}, 60]][[1]] (* Harvey P. Dale, Dec 07 2011 *)

PARI

{ my(a,a1,a2); for (n=0, 60, if (n>1, a=sumdigits(a1) + a2; a2=a1; a1=a, if (n, a=a1=1, a=a2=0)); print1(a, ", ") ) } \\ Harry J. Smith, Oct 06 2009

Extensions

More terms from Larry Reeves (larryr(AT)acm.org) and Robert G. Wilson v, Nov 13 2001