cp's OEIS Frontend

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

%I A065076 #28 Mar 18 2025 16:06:12
%S A065076 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,
%T A065076 91,100,92,111,95,125,103,129,115,136,125,144,134,152,142,159,157,172,
%U A065076 167,186,182,197,199,216,208,226,218,237,230,242,238,255,250,262,260,270
%N A065076 a(0) = 0, a(1) = 1, a(n) = (sum of digits of a(n-1)) + a(n-2).
%H A065076 Harry J. Smith, <a href="/A065076/b065076.txt">Table of n, a(n) for n = 0..1000</a>
%e A065076 a(8) = 12 because a(7) = 13, a(6) = 8 and 4 = 1+3 and 12 = 4 + 8.
%t A065076 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} ]
%t A065076 Transpose[NestList[{Last[#],Total[IntegerDigits[Last[#]]]+First[#]}&, {0,1}, 60]][[1]] (* _Harvey P. Dale_, Dec 07 2011 *)
%o A065076 (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
%o A065076 (Haskell)
%o A065076 a065076 n = a065076_list !! n
%o A065076 a065076_list = 0 : 1 : zipWith (+)
%o A065076                 a065076_list (map a007953 $ tail a065076_list)
%o A065076 -- _Reinhard Zumkeller_, Nov 13 2014
%Y A065076 Cf. A007953 and A007612.
%Y A065076 Cf. A030132.
%K A065076 nonn,base,easy
%O A065076 0,4
%A A065076 _Bodo Zinser_, Nov 09 2001
%E A065076 More terms from Larry Reeves (larryr(AT)acm.org) and _Robert G. Wilson v_, Nov 13 2001