login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A124229 Numerator of g(n) defined by g(1)=1, g(2n)=1/g(n)+1, g(2n+1)=g(2n). 1
1, 2, 2, 3, 3, 3, 3, 5, 5, 5, 5, 5, 5, 5, 5, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..79.

FORMULA

a(n) = A000045(ceiling(log(n+1)/log(2))+1).

a(1)=1 then a(n) = a(floor(n/2)) + a(floor(n/4)). - Benoit Cloitre, Feb 03 2014

PROG

(PARI) g(n)=if(n<2, 1, if(n%2, g(n-1), 1/g(n/2)+1)) //then// a(n)=numerator(g(n)) //or// a(n)=fibonacci(ceil(log(n+1)/log(2))+1)

(PARI) a(n)=if(n<2, 1, a(n\2)+a(n\4))

CROSSREFS

Cf. A020650, A124230.

Sequence in context: A259195 A143997 A160903 * A055377 A157524 A239496

Adjacent sequences:  A124226 A124227 A124228 * A124230 A124231 A124232

KEYWORD

frac,nonn

AUTHOR

Benoit Cloitre, Oct 20 2006

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 15 22:02 EST 2019. Contains 330012 sequences. (Running on oeis4.)