Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006347
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006347 a(n) = (n+1) a(n-1) + (-1)^n.
(Formerly M3018)
+0
1
0, 1, 3, 16, 95, 666, 5327, 47944, 479439, 5273830, 63285959, 822717468, 11518044551, 172770668266, 2764330692255, 46993621768336, 845885191830047, 16071818644770894, 321436372895417879, 6750163830803775460 (list; graph; listen)
OFFSET

1,3

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

FORMULA

E.g.f.: x(1-x/2-exp(-x))/(1-x)^2. a(n)=n(a(n-1)+a(n-2)), n>2.

a(n)=round((1/2-exp(-1))*(n+1)!) - Benoit Cloitre (abmt(AT)orange.fr), Sep 24 2006

MAPLE

a:=n->-n!*sum((-1)^k/k!, k=3..n): seq(a(n), n=2..21); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 25 2007

PROGRAM

(PARI) a(n)=if(n<2, 0, (n+1)*a(n-1)+(-1)^n)

(PARI) a(n)=round((1/2-exp(-1))*(n+1)!) - Benoit Cloitre (abmt(AT)orange.fr), Sep 24 2006

CROSSREFS

Sequence in context: A074555 A137644 A114174 this_sequence A000270 A157051 A000271

Adjacent sequences: A006344 A006345 A006346 this_sequence A006348 A006349 A006350

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research