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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A092910 a(n)=(3n+2)-th component of the continued fraction for sum(k>=0,2^(-k!)). 0
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; refs; listen; history; internal format)
OFFSET

0,1

FORMULA

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

PROG

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

CROSSREFS

Cf. A007400, A076157.

Sequence in context: A199286 A188722 A038774 * A073322 A006197 A079404

Adjacent sequences:  A092907 A092908 A092909 * A092911 A092912 A092913

KEYWORD

nonn

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 11:25 EST 2012. Contains 205777 sequences.