|
Search: id:A101437
|
|
|
| A101437 |
|
a(1) = 1; a(n+1) = sum{k=1 to n} a(n+1-k)(mod k). |
|
+0
1
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
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}] (from Robert G. Wilson v Jan 25 2005)
|
|
CROSSREFS
|
Sequence in context: A023821 A075258 A127779 this_sequence A039856 A143715 A159685
Adjacent sequences: A101434 A101435 A101436 this_sequence A101438 A101439 A101440
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet Jan 18 2005
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Jan 25 2005
|
|
|
Search completed in 0.002 seconds
|
