The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A215526 a(0)=a(1)=1, a(n) = a(n-2) + a(a(n-1) mod n). 1
 1, 1, 2, 3, 5, 4, 10, 7, 17, 24, 22, 25, 23, 47, 27, 70, 37, 73, 38, 74, 65, 76, 87, 114, 125, 115, 150, 185, 223, 250, 245, 473, 360, 718, 365, 788, 725, 875, 726, 1000, 727, 1245, 912, 1269, 1787, 1629, 1861, 1852, 2084, 2002, 2086, 3863, 2156, 4588, 4312 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Same formula, seed {0,1} : 0, 1, 1, 2, 2, 3, 4, 5, 7, 10, 7, 15, 9, 25, 24, 35, 26, 45, 36, 90, 43, 91, 45, 136, 71, 227, 161, 388, 232, 388, 464, 852, 507, 861, 522, 1368, 522 LINKS Ivan Neretin, Table of n, a(n) for n = 0..10000 MATHEMATICA Fold[Append[#1, #1[[-2]] + #1[[1 + Mod[#1[[-1]], #2]]]] &, {1, 1}, Range[2, 54]] (* Ivan Neretin, Sep 07 2017 *) PROG (Python) a = [1]*1000 for n in range(2, 77):     print a[n-2],     a[n] = a[n-2] + a[a[n-1] % n] CROSSREFS Cf. A215525. Sequence in context: A100932 A064360 A075158 * A246841 A066417 A254669 Adjacent sequences:  A215523 A215524 A215525 * A215527 A215528 A215529 KEYWORD nonn,easy AUTHOR Alex Ratushnyak, Aug 15 2012 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 1 01:38 EDT 2020. Contains 333153 sequences. (Running on oeis4.)