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

%I #11 Apr 01 2017 07:47:56

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

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

%U 31,30,30,30,31,31,31,31,32,32,32,32,32,32,32,32,33,34,35,35,35

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

%H Altug Alkan, <a href="/A284520/b284520.txt">Table of n, a(n) for n = 1..20000</a>

%H Altug Alkan, <a href="/A284520/a284520.png">Scatterplot of A284520</a>

%e a(5) = 3 because a(5) = a(a(4)-1) + a(5-a(2)-1) = a(1) + a(2) = 3.

%o (PARI) a=vector(1000); 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]-1]); a

%Y Cf. A004001, A005185, A005229, A055748, A070867, A226222, A284511.

%K nonn,look

%O 1,2

%A _Altug Alkan_, Mar 28 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 March 29 02:23 EDT 2024. Contains 371264 sequences. (Running on oeis4.)