Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A124229
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A124229 Numerator of g(n) defined by g(1)=1, g(2n)=1/g(n)+1, g(2n+1)=g(2n). +0
2
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; listen)
OFFSET

0,2

FORMULA

a(n)=F(ceil(log(n+1)/log(2))+1) where F=A000045

PROGRAM

(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)

CROSSREFS

Cf. A020650, A124230.

Sequence in context: A024695 A143997 A160903 this_sequence A055377 A157524 A128586

Adjacent sequences: A124226 A124227 A124228 this_sequence A124230 A124231 A124232

KEYWORD

frac,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 20 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research