Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #11 Jan 09 2015 19:24:12
%S 5,10,16,29,53,85,130,179,245,322,406,500,599,721,853,1001,1151,1309,
%T 1480,1664,1865,2086,2323,2570,2831,3106,3391,3692,4013,4342,4684,
%U 5048,5429,5830,6247,6683,7142,7615,8107,8615,9143,9688,10264,10853,11459
%N Similar to A072921 but starting with 5.
%H Alois P. Heinz, <a href="/A152234/b152234.txt">Table of n, a(n) for n = 1..1000</a>
%p b:= proc(n) option remember; local m; m:= a(n); `if`(n=1, 0, b(n-1)); while m>0 do %+ irem(m, 10, 'm') od; % end: a:= proc(n) option remember; `if`(n=1, 5, a(n-1) +b(n-1)) end: seq(a(n), n=1..50); # _Alois P. Heinz_, Oct 07 2009
%t a[0] = a[1] = 5; a[n_] := a[n] = 2*a[n-1]-a[n-2]+Total[IntegerDigits[a[n-1]]]; Table[a[n], {n, 1, 45}] (* _Jean-François Alcover_, Mar 05 2014 *)
%K nonn,base,easy
%O 1,1
%A _N. J. A. Sloane_, Oct 07 2009