|
Search: id:A065076
|
|
|
| A065076 |
|
a(0) = 0, a(1) = 1, a(n) = (sum of digits of a(n-1)) + a(n-2). |
|
+0
3
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=0,...,1000
|
|
EXAMPLE
|
a(8) = 12 because a(7) = 13, a(6) = 8 and 4 = 1+3 and 12 = 4+8
|
|
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} ]
|
|
PROGRAM
|
(PARI): digitsum(n) = local(v, d); v=[]; while(n>0, d=divrem(n, 10); n=d[1]; v= concat(v, d[2])); sum(j=1, matsize(v)[2], v[j]) a065076(m)=local(a, j, v, w); w=1; print1(w, ", "); v=1; print1(v, ", "); for(j=3, m, a=digitsum(v)+w; print1(a, ", "); w=v; v=a) a065076(65)
(PARI) SumD(x)= { local(s); s=0; while (x>9, s+=x-10*(x\10); x\=10); return(s + x) } { for (n=0, 1000, if (n>1, a=SumD(a1) + a2; a2=a1; a1=a, if (n, a=a1=1, a=a2=0)); write("b065076.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 06 2009]
|
|
CROSSREFS
|
Cf. A007953 and A007612.
Sequence in context: A074867 A131297 A010077 this_sequence A069638 A010076 A138183
Adjacent sequences: A065073 A065074 A065075 this_sequence A065077 A065078 A065079
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
Bodo Zinser (BodoZinser(AT)Compuserve.com), Nov 09 2001
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org) and Robert G. Wilson v (rgwv(AT)rgwv.com), Nov 13 2001
|
|
|
Search completed in 0.002 seconds
|
