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!)
A304493 a(0) = 1; a(n) = a(n-a(floor(n/2))) + a(n-a(floor(n/4))). 1

%I #11 Dec 02 2019 15:14:08

%S 1,2,3,5,5,8,7,11,13,12,14,18,19,20,17,19,23,24,27,28,26,31,22,27,32,

%T 34,35,37,42,46,46,45,40,40,45,40,44,48,49,55,52,56,60,65,57,64,70,72,

%U 69,70,68,64,64,67,69,67,72,71,75,80,73,79,89,84,88,94,100,94,84,96,116,117,106,116,107,106

%N a(0) = 1; a(n) = a(n-a(floor(n/2))) + a(n-a(floor(n/4))).

%H Robert Israel, <a href="/A304493/b304493.txt">Table of n, a(n) for n = 0..10000</a>

%H Ilya Gutkovskiy, <a href="/A304493/a304493.jpg">Scatter plot of a(n) up to n=50000</a>

%H <a href="/index/Ho#Hofstadter">Index entries for Hofstadter-type sequences</a>

%p f:= proc(n) option remember;

%p procname(n-procname(floor(n/2)))+procname(n-procname(floor(n/4)))

%p end proc:

%p f(0):= 1;

%p map(f, [$0..100]); # _Robert Israel_, Dec 02 2019

%t a[n_] := a[n] = a[n - a[Floor[n/2]]] + a[n - a[Floor[n/4]]]; a[0] = 1; Table[a[n], {n, 0, 75}]

%Y Cf. A002265, A004526, A005185, A083662, A244477.

%K nonn,look

%O 0,2

%A _Ilya Gutkovskiy_, May 13 2018

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 September 16 15:31 EDT 2024. Contains 375976 sequences. (Running on oeis4.)