login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A124230
Denominator of g(n) defined by g(1)=1, g(2n)=1/g(n)+1, g(2n+1)=g(2n).
2
1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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
OFFSET
1,4
FORMULA
a(n) = A000045(ceiling(log(n+1)/log(2))).
a(n) = A000045(A070939(n)). - Paolo Xausa, Oct 17 2024
MATHEMATICA
Fibonacci[BitLength[Range[100]]] (* Paolo Xausa, Oct 16 2024 *)
PROG
(PARI) g(n)=if(n<2, 1, if(n%2, g(n-1), 1/g(n/2)+1))
a(n)=denominator(g(n))
(PARI) a(n)=fibonacci(ceil(log(n+1)/log(2)))
CROSSREFS
KEYWORD
frac,nonn
AUTHOR
Benoit Cloitre, Oct 20 2006
STATUS
approved