A124229 - OEIS

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

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”).

Other ways to Give

A124229

Numerator of g(n) defined by g(1)=1, g(2n)=1/g(n)+1, g(2n+1)=g(2n).

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

1,2

LINKS

Paolo Xausa, Table of n, a(n) for n = 1..10000

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

a(n) = A000045(A070939(n) + 1). - Paolo Xausa, Oct 17 2024

MATHEMATICA

Fibonacci[BitLength[Range[100]] + 1] (* Paolo Xausa, Oct 16 2024 *)

PROG