login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A286389 a(0) = 0; a(n) = n - a(floor(a(n-1)/2)). 1
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, 20, 20, 21, 22, 23, 24, 24, 25, 26, 26, 27, 28, 29, 30, 30, 31, 32, 32, 33, 34, 34, 35, 36, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

A variation on Hofstadter's G-sequence.

Conjecture: partial sums of A285431 (verified for n <= 400).

LINKS

Anton Mosunov, Table of n, a(n) for n = 0..400

Index entries for Hofstadter-type sequences

FORMULA

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

MATHEMATICA

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

PROG

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

CROSSREFS

Cf. A005206, A138466, A160390.

Sequence in context: A272206 A122797 A281957 * A309945 A103354 A127038

Adjacent sequences: A286386 A286387 A286388 * A286390 A286391 A286392

KEYWORD

nonn

AUTHOR

Ilya Gutkovskiy, May 24 2017

STATUS

approved

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 November 30 18:07 EST 2022. Contains 358453 sequences. (Running on oeis4.)