Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A092910
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A092910 a(n)=(3n+2)-th component of the continued fraction for sum(k>=0,2^(-k!)). +0
1
3, 4, 3, 3, 2, 3, 4, 3, 2, 4, 3, 2, 3, 3, 4, 3, 2, 4, 3, 3, 2, 3, 4, 2, 3, 4, 3, 2, 3, 3, 4, 3, 2, 4, 3, 3, 2, 3, 4, 3, 2, 4, 3, 2, 3, 3, 4, 2, 3, 4, 3, 3, 2, 3, 4, 2, 3, 4, 3, 2, 3, 3, 4, 3, 2, 4, 3, 3, 2, 3, 4, 3, 2, 4, 3, 2, 3, 3, 4, 3, 2, 4, 3, 3, 2, 3, 4, 2, 3, 4, 3, 2, 3, 3, 4, 2, 3, 4, 3, 3, 2, 3, 4, 3, 2 (list; graph; listen)
OFFSET

0,1

FORMULA

a(n)=5-A007400(n+2)/2

PROGRAM

(PARI) a(n)=5-component(contfrac(sum(i=0, 10, 1/2^(2^i))), n+3)/2

CROSSREFS

Cf. A007400, A076157.

Sequence in context: A164358 A133617 A038774 this_sequence A073322 A006197 A079404

Adjacent sequences: A092907 A092908 A092909 this_sequence A092911 A092912 A092913

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 16 2004

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 December 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research