Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073587
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A073587 a(n)=a(n-1)*2^n+1 where a(0)=1. +0
2
3, 13, 105, 1681, 53793, 3442753, 440672385, 112812130561, 57759810847233, 59146046307566593, 121131102837896382465, 496152997224023582576641, 4064485353259201188467843073, 66592528027798752271857140908033 (list; graph; listen)
OFFSET

1,1

FORMULA

a(n) = floor(D*2^(n*(n+1)/2)) where D is a constant, D=1.64163256065515386629...=sum(k>=0, 1/2^(k(k+1)/2)) - Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 01 2002

PROGRAM

25 A=1 30 for I=1 to 20 40 A=A*2^I+1 50 print A 60 next 70 end

CROSSREFS

Sequence in context: A127004 A068168 A098027 this_sequence A061377 A006860 A090537

Adjacent sequences: A073584 A073585 A073586 this_sequence A073588 A073589 A073590

KEYWORD

easy,nonn

AUTHOR

Felice Russo (felice.russo(AT)katamail.com), Aug 28 2002

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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research