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!)
 A134679 a(1) = ... = a(6) = 1; a(n)=a(n-a(n-1))+a(n-a(n-6)). 2
 1, 1, 1, 1, 1, 1, 2, 3, 4, 5, 6, 7, 7, 8, 8, 9, 9, 10, 11, 11, 12, 12, 14, 13, 15, 14, 15, 16, 15, 17, 17, 18, 18, 19, 20, 20, 20, 21, 22, 22, 23, 23, 25, 25, 25, 25, 25, 29, 24, 29, 26, 29, 29, 30, 32, 28, 32, 29, 34, 31, 32, 36, 32, 38, 32, 39, 36, 36, 38, 36, 42, 35, 41, 39, 40 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,7 COMMENTS The sequence dies after 2354 terms. - N. J. A. Sloane, Apr 15 2014 LINKS T. D. Noe, Table of n, a(n) for n = 1..2354 (complete sequence) MATHEMATICA Clear[a]; a[n_] := a[n] = If[n<=6, 1, a[n-a[n-1]]+a[n-a[n-6]]]; t={1}; n=2; While[n<10000 && a[n-1]

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 January 28 09:17 EST 2020. Contains 331318 sequences. (Running on oeis4.)