This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A057176 a(0) = 1; for n >= 1, a(n) = Sum_{j=0..a(n-1) mod n} a(j). 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; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Michael De Vlieger, Table of n, a(n) for n = 0..10000 FORMULA a(0) = 1; for n >= 1, a(n) = Sum_{j=0..a(n-1) mod n} a(j). 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 * A194671 A131398 A249307 Adjacent sequences:  A057173 A057174 A057175 * A057177 A057178 A057179 KEYWORD nonn AUTHOR Leroy Quet, Aug 03 2003 EXTENSIONS More terms from Farideh Firoozbakht, Aug 03 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 15 22:20 EST 2018. Contains 317252 sequences. (Running on oeis4.)