Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A085010
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A085010 a(n)=2^(2^n)*sum(k=0,n,1/2^(2^k)). +0
1
1, 3, 13, 209, 53505, 3506503681, 15060318633198616577, 277813843495134114797235287762174738433, 94535152227927400227782074307303551040545228366095741656402842333161034088449 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n)=A074854(2^n)=; a(n)=floor(c*2^(2^n)) where c=sum(k>=0, 1/2^(2^k))=0.81642150902...

CROSSREFS

Cf. A007404.

Adjacent sequences: A085007 A085008 A085009 this_sequence A085011 A085012 A085013

Sequence in context: A002065 A087601 A112093 this_sequence A100441 A036680 A111431

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 19 2003

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 October 13 02:37 EDT 2008. Contains 145008 sequences.


AT&T Labs Research