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!)
A287601 a(0) = a(1) = 1; a(2*n) = n - a(a(n)), a(2*n+1) = a(a(n)) + a(n-a(n)). 0
1, 1, 0, 2, 1, 1, 3, 1, 3, 3, 4, 2, 4, 4, 6, 4, 6, 3, 7, 5, 9, 4, 11, 3, 11, 4, 12, 4, 11, 6, 14, 3, 13, 7, 15, 8, 17, 3, 18, 7, 17, 5, 20, 4, 20, 4, 21, 11, 22, 6, 24, 5, 22, 10, 26, 4, 26, 5, 26, 6, 24, 12, 29, 13, 28, 9, 32, 13, 30, 9, 32, 7, 33, 8, 35, 17, 31, 16, 38, 14, 37, 6, 40, 18, 33, 20 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
COMMENTS
A variation on Hofstadter's G-sequence and Hofstadter-Conway $10000 sequence.
LINKS
Eric Weisstein's World of Mathematics, Hofstadter G-Sequence
Eric Weisstein's World of Mathematics, Hofstadter-Conway 10000-Dollar Sequence
MATHEMATICA
a[0] = 1; a[1] = 1; a[n_] := If[EvenQ[n], n/2 - a[a[n/2]], a[a[(n - 1)/2]] + a[(n - 1)/2 - a[(n - 1)/2]]]; Table[a[n], {n, 0, 85}]
CROSSREFS
Sequence in context: A136405 A210871 A308399 * A035667 A092865 A098925
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, May 27 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 March 28 17:42 EDT 2024. Contains 371254 sequences. (Running on oeis4.)