login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A285507 a(1) = a(2) = 1, a(3) = a(4) = 2; a(n) = a(a(n-2)-1) + a(n-a(n-3)-1) for n > 4. 2
1, 1, 2, 2, 3, 3, 3, 3, 4, 4, 5, 5, 5, 5, 6, 6, 8, 8, 8, 8, 8, 8, 8, 9, 9, 11, 11, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 16, 16, 17, 17, 17, 17, 18, 18, 21, 21, 21, 20, 21, 21, 21, 21, 21, 21, 21, 21, 22, 22, 24, 24, 24, 24, 24, 25, 25, 26, 26, 26, 26, 27, 27, 32, 32, 34, 30, 31, 29, 34, 33, 34, 34, 33, 33, 34, 34 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
EXAMPLE
a(5) = 3 because a(5) = a(a(3)-1) + a(5-a(2)-1) = a(1) + a(3) = 3.
MATHEMATICA
a[1]=a[2]=1; a[3]=a[4]=2; a[n_] := a[n] = a[a[n-2]-1] + a[n-a[n-3]-1]; Array[a, 88] (* Giovanni Resta, Apr 21 2017 *)
PROG
(PARI) a=vector(10000); a[1]=a[2]=1; a[3]=a[4]=2; for(n=5, #a, a[n]=a[a[n-2]-1]+a[n-a[n-3]-1]); va = vector(10000, n, a[n])
CROSSREFS
Sequence in context: A092695 A281687 A033270 * A103264 A225644 A225633
KEYWORD
nonn,look
AUTHOR
Altug Alkan, Apr 20 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)