Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003470
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003470 a(n) = n*a(n-1) - a(n-2) + 1 + (-1)^n.
(Formerly M2759)
+0
3
1, 1, 3, 8, 31, 147, 853, 5824, 45741, 405845, 4012711, 43733976, 520795003, 6726601063, 93651619881, 1398047697152, 22275111534553, 377278848390249, 6768744159489931, 128228860181918440, 2557808459478878871 (list; graph; listen)
OFFSET

0,3

COMMENT

Row sums of A086764. - DELEHAM Philippe (kolotoko(AT)wanadoo.fr), Apr 27 2004

REFERENCES

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

FORMULA

Diagonal sums of reverse of permutation triangle A008279. a(n)=sum{k=0..floor(n/2), (n-k)!/k!}. - Paul Barry (pbarry(AT)wit.ie), May 12 2004

CROSSREFS

Cf. A072374.

Sequence in context: A148901 A148902 A108492 this_sequence A148903 A148904 A148905

Adjacent sequences: A003467 A003468 A003469 this_sequence A003471 A003472 A003473

KEYWORD

nonn,easy

AUTHOR

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

EXTENSIONS

More terms from Gabriel Cunningham (gcasey(AT)mit.edu), Oct 25 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 December 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research