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

%I #17 Jun 06 2018 18:19:51

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

%T 14,14,14,14,14,14,14,15,16,16,16,17,18,18,18,18,19,20,21,21,22,23,23,

%U 23,23,23,23,23,23,23,24,25,25,25,26,27,28,28,28,28,29,29,29,29,30,31,32,32

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

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

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

%p a:= proc(n) option remember: if n<5 then 1 else procname(procname(n-4))+procname(n-procname(n-3)) fi end: seq(a(n), n=1..80); # _Muniru A Asiru_, Jun 06 2018

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

%o (GAP) a:=[1,1,1,1];; for n in [5..80] do a[n]:=a[a[n-4]]+a[n-a[n-3]]; od; a; # _Muniru A Asiru_, Jun 06 2018

%Y Cf. A004001, A005185.

%K nonn,look

%O 1,5

%A _Altug Alkan_, May 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 August 11 12:53 EDT 2024. Contains 375069 sequences. (Running on oeis4.)