Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056541
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056541 a(n) = 2n*a(n-1) + 1 with a(0)=0. +0
2
0, 1, 5, 31, 249, 2491, 29893, 418503, 6696049, 120528883, 2410577661, 53032708543, 1272785005033, 33092410130859, 926587483664053, 27797624509921591, 889523984317490913, 30243815466794691043 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n) =floor[(sqrt(e)-1)*2^n*n! ] =A010844(n)-A000165(n)

a(n) = Sum[P(n, k) * 2^k {k=0 to n-1}] - Ross La Haye (rlahaye(AT)new.rr.com), Sep 15 2004

EXAMPLE

a(3)=2*3*a(2)+1=6*5+1=31

MATHEMATICA

s=0; lst={s}; Do[s+=s++n; AppendTo[lst, Abs[s]], {n, 1, 5!, 2}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Oct 23 2008]

CROSSREFS

Cf. A002627.

Sequence in context: A082579 A024451 A046852 this_sequence A126121 A167137 A000556

Adjacent sequences: A056538 A056539 A056540 this_sequence A056542 A056543 A056544

KEYWORD

easy,nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Jun 20 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 November 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research