|
Search: id:A057176
|
|
|
| A057176 |
|
a(0) = 1; and for n >= 1, a(n) = sum{j=0 to a(n-1)(mod n)} a(j). |
|
+0
5
|
|
| 1, 1, 2, 4, 1, 2, 4, 9, 2, 4, 9, 30, 15, 4, 9, 30, 97, 84, 84, 26, 15, 127, 308, 30, 15, 127, 898, 24, 913, 97, 24, 913, 308, 69, 2, 4, 9, 30, 2996, 4217, 308, 560, 97, 69, 1040, 11, 69, 868, 9, 30, 2996, 7327, 14566, 13618, 39, 11544, 26, 1938, 913
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
FORMULA
|
a[0]=1; a[m_] := Sum[a[j], {j, 0, Mod[a[m-1], m]}] - Farideh Firoozbakht (f.firoozbakht(AT)sci.ui.ac.ir), Aug 03 2003
|
|
MATHEMATICA
|
a[m_] := Sum[a[j], {j, 0, Mod[a[m-1], m]}]; vv={1}; Do[a[n]=If[n==0, 1, b]; v=a[n+1]; vv=Insert[vv, v, -1]; b=v, {n, 0, 50}]; vv
|
|
CROSSREFS
|
Sequence in context: A062039 A035492 A101229 this_sequence A131398 A050980 A053451
Adjacent sequences: A057173 A057174 A057175 this_sequence A057177 A057178 A057179
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), Aug 03 2003
|
|
EXTENSIONS
|
More terms from Farideh Firoozbakht (f.firoozbakht(AT)sci.ui.ac.ir), Aug 03 2003
|
|
|
Search completed in 0.002 seconds
|
