login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

LINKS

Table of n, a(n) for n=1..62.

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 A143715 A159685

Adjacent sequences:  A101434 A101435 A101436 * A101438 A101439 A101440

KEYWORD

nonn

AUTHOR

Leroy Quet, Jan 18 2005

EXTENSIONS

More terms from Robert G. Wilson v, Jan 25 2005

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.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 8 19:05 EST 2016. Contains 278948 sequences.