login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A287354 a(n) = n for 1 <= n <= 5; a(n) = a(n-a(n-1)+1) + a(n-a(n-2)+2) for n > 5. 1

%I

%S 1,2,3,4,5,6,6,7,8,8,9,10,10,11,11,12,13,13,13,15,14,16,16,16,17,18,

%T 18,19,19,20,21,21,21,22,23,23,23,25,24,26,25,26,28,28,26,29,29,29,30,

%U 30,32,30,32,34,33,32,36,35,34,36,37,37,37,38,39,39,39,41,40,42,41,42

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

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

%H Altug Alkan, <a href="/A287354/a287354.png">Scatterplot of a(n)</a>

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

%Y Cf. A005185, A287292.

%K nonn

%O 1,2

%A _Altug Alkan_, May 23 2017

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 16 05:22 EDT 2021. Contains 348035 sequences. (Running on oeis4.)