login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A285509
a(1) = 1; a(2) = a(3) = a(4) = 2; a(n) = a(a(n-1)-1) + a(n-a(n-3)) for n > 4.
1
1, 2, 2, 2, 3, 4, 5, 5, 5, 5, 6, 8, 10, 10, 10, 9, 10, 10, 10, 10, 11, 13, 18, 20, 18, 15, 15, 15, 20, 20, 19, 18, 20, 20, 20, 19, 20, 20, 20, 20, 21, 23, 31, 38, 33, 28, 20, 20, 21, 30, 39, 39, 38, 30, 29, 25, 35, 40, 40, 38, 31, 33, 36, 40, 38, 40, 35, 40, 40, 40, 39, 38, 40, 40, 40, 39, 40, 40, 40, 40, 41, 43, 54, 69
OFFSET
1,2
COMMENTS
Although sequence is unpredictable with its complex growth characteristic and generational structure, it has various signs of order and there are many temporary and simple patterns on it. For example, values of a(n) such that a(n) = a(n + 1) = a(n + 2) = a(n + 3) are 5, 10, 20, 40, 80, 160, 320, 640, 1280, ...
EXAMPLE
a(5) = 3 because a(5) = a(a(4)-1) + a(5-a(2)) = a(1) + a(3) = 2.
MATHEMATICA
a[1]=1; a[2]=a[3]=a[4]=2; a[n_] := a[n] = a[a[n-1]-1] + a[n-a[n-3]]; Array[a, 84] (* Giovanni Resta, Apr 21 2017 *)
PROG
(PARI) a=vector(10000); a[1]=1; a[2]=a[3]=a[4]=2; for(n=5, #a, a[n]=a[a[n-1]-1]+a[n-a[n-3]]); va = vector(10000, n, a[n])
CROSSREFS
KEYWORD
nonn,look
AUTHOR
Altug Alkan, Apr 20 2017
STATUS
approved