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!)
 A283422 a(1) = a(2) = a(4) = 1; a(3) = 0;  a(n) = a(n-a(n-1)-1) + a(n-a(n-2)-4) for n > 4. 1
 1, 1, 0, 1, 1, 2, 2, 2, 2, 3, 3, 3, 4, 4, 5, 5, 5, 5, 7, 6, 7, 7, 8, 9, 9, 9, 9, 10, 10, 12, 10, 12, 13, 11, 13, 14, 13, 15, 15, 16, 16, 16, 17, 18, 18, 18, 19, 19, 19, 21, 20, 19, 23, 22, 22, 25, 20, 23, 26, 26, 21, 28, 26, 25, 28, 26, 29, 30, 29, 30, 31, 31, 31, 31, 33, 32, 34, 33 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 LINKS Altug Alkan, Table of n, a(n) for n = 1..10000 Altug Alkan, Plot of first differences MATHEMATICA a[1] = a[2] = a[4] = 1; a[3] = 0; a[n_] := a[n] = a[n - a[n - 1] - 1] + a[n - a[n - 2] - 4]; Array[a, 78] (* Michael De Vlieger, May 15 2017 *) PROG (PARI) q=vector(10000); q[1]=q[2]=q[4]=1; q[3]=0; for(n=5, #q, q[n]=q[n-1-q[n-1]]+q[n-4-q[n-2]]); vector(10000, n, q[n]) CROSSREFS Cf. A005185. Sequence in context: A120203 A029280 A060971 * A091946 A094996 A120194 Adjacent sequences:  A283419 A283420 A283421 * A283423 A283424 A283425 KEYWORD nonn,look AUTHOR Altug Alkan, May 14 2017 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 9 10:32 EDT 2020. Contains 333348 sequences. (Running on oeis4.)