Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093302
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093302 a(n) = (a(n-1)+(2n-1))*(2n) with a(0)=0. +0
1
0, 2, 20, 150, 1256, 12650, 151932, 2127230, 34035920, 612646866, 12252937700, 269564629862, 6469551117240, 168208329048890, 4709833213369676, 141294996401091150, 4521439884834917792, 153728956084387206050 (list; graph; listen)
OFFSET

0,2

FORMULA

2 * [e^(1/2) * n! * 2^n] - 2n - 2.

E.g.f.: (2x+4x^2)/(1-2x) * exp(x).

PROGRAM

(PARI) a(n)=2*floor(exp(1/2)*n!*2^n)-2*n-2

CROSSREFS

a(n) = A007566(n)-1 = 2*A010844(n)-2n-2. Bisection of A077138.

Adjacent sequences: A093299 A093300 A093301 this_sequence A093303 A093304 A093305

Sequence in context: A000183 A081159 A105489 this_sequence A093130 A043029 A115489

KEYWORD

easy,nonn

AUTHOR

Emrehan Halici (emrehan(AT)halici.com.tr), Apr 24 2004

EXTENSIONS

Edited by Ralf Stephan, Apr 26 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 May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research