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!)
A285588 a(1) = a(2) = 1; a(3) = a(4) = a(5) = 2; a(n) = a(a(n-3)-1) + a(n-a(n-5)-2) for n > 5. 1

%I #9 May 01 2017 08:29:57

%S 1,1,2,2,2,3,3,3,3,4,4,4,5,5,5,6,6,6,6,7,7,7,8,9,9,9,9,9,9,9,10,10,10,

%T 11,12,12,13,13,13,13,13,13,13,13,13,14,14,14,16,17,17,17,19,18,18,19,

%U 19,19,19,19,19,19,19,19,19,19,20,20,20,22,23,23,24,24,24,25,25,25,28,27

%N a(1) = a(2) = 1; a(3) = a(4) = a(5) = 2; a(n) = a(a(n-3)-1) + a(n-a(n-5)-2) for n > 5.

%H Altug Alkan, <a href="/A285588/b285588.txt">Table of n, a(n) for n = 1..10000</a>

%H Altug Alkan, <a href="/A285588/a285588.png">Alternative scatterplot</a>

%t a[1] = a[2] = 1; a[3] = a[4] = a[5] = 2; a[n_] := a[n] = a[a[n - 3] - 1] + a[n - a[n - 5] - 2]; Array[a, 80] (* _Michael De Vlieger_, Apr 23 2017 *)

%o (PARI) q=vector(10000); q[1]=q[2]=1;q[3]=q[4]=q[5]=2; for(n=6, #q, q[n]=q[q[n-3]-1]+q[n-q[n-5]-2]); vector(10000, n, q[n])

%Y Cf. A005185, A055748.

%K nonn

%O 1,3

%A _Altug Alkan_, Apr 22 2017

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 24 13:12 EDT 2024. Contains 371946 sequences. (Running on oeis4.)