Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A055214
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A055214 a(n) = 2n*a(n-1) - 1. +0
1
1, 1, 3, 17, 135, 1349, 16187, 226617, 3625871, 65265677, 1305313539, 28716897857, 689205548567, 17919344262741, 501741639356747, 15052249180702409, 481671973782477087, 16376847108604220957 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n) = ceiling[2^n * n! * (2-sqrt(e))] = ceiling[A000165(n) * (2-sqrt(e))]

EXAMPLE

a(3) = 2*3*a(2)-1 = 6*3-1 = 17

CROSSREFS

Sequence in context: A073513 A074524 A093986 this_sequence A105630 A006290 A060003

Adjacent sequences: A055211 A055212 A055213 this_sequence A055215 A055216 A055217

KEYWORD

easy,nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Jun 19 2000

EXTENSIONS

More terms from James A. Sellers (sellersj(AT)math.psu.edu), Jul 04 2000

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research