login

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”).

A101437
a(1) = 1; a(n+1) = sum{k=1 to n} a(n+1-k)(mod k).
0
1, 0, 1, 1, 2, 3, 3, 6, 6, 8, 11, 13, 17, 15, 25, 30, 34, 34, 46, 47, 42, 61, 72, 82, 76, 86, 93, 95, 102, 130, 145, 163, 153, 148, 172, 230, 205, 226, 214, 182, 230, 231, 272, 322, 329, 315, 340, 373, 354, 356, 378, 431, 510, 457, 498, 565, 558, 468, 528, 591, 613, 578
OFFSET
1,5
EXAMPLE
a(7) = a(6)(mod 1) + a(5)(mod 2) + a(4)(mod 3) + a(3)(mod 4) + a(2)(mod 5) + a(1)(mod 6) = 0 + 0 + 1 + 1 + 0 + 1 = 3.
MATHEMATICA
a[1] = 1; a[n_] := a[n] = Sum[Mod[a[n - k], k], {k, 1, n - 1}]; Table[ a[n], {n, 62}] (* Robert G. Wilson v, Jan 25 2005 *)
CROSSREFS
Sequence in context: A127779 A207634 A222862 * A039856 A301703 A143715
KEYWORD
nonn
AUTHOR
Leroy Quet, Jan 18 2005
EXTENSIONS
More terms from Robert G. Wilson v, Jan 25 2005
STATUS
approved