This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A286389 a(0) = 0; a(n) = n - a(floor(a(n-1)/2)). 1

%I

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

%T 20,20,21,22,23,24,24,25,26,26,27,28,29,30,30,31,32,32,33,34,34,35,36,

%U 36,37,38,39,40,40,41,42,42,43,44,45,46,46,47,48,48,49,50,51,52,52,53,54,54,55,56,57,58,58

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

%C A variation on Hofstadter's G-sequence.

%H Anton Mosunov, <a href="/A286389/b286389.txt">Table of n, a(n) for n = 0..400</a>

%F Conjecture: a(n) ~ c*n, where c = sqrt(3) - 1 = 0.732050807...

%t a[0] = 0; a[n_] := a[n] = n - a[Floor[a[n - 1]/2]]; Array[a, 80, 0]

%o (PARI) a(n)=if(n>0,return(n-a(floor(a(n-1)/2))));return(0); \\ Anton Mosunov, May 26 2017

%Y Cf. A005206, A138466, A160390.

%K nonn

%O 0,3

%A _Ilya Gutkovskiy_, May 24 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 15 05:56 EDT 2018. Contains 316202 sequences. (Running on oeis4.)