Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056199
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056199 A simple recurrence. +0
4
0, 1, 3, 11, 51, 291, 1971, 15411, 136371, 1345971, 14651571, 174318771, 2249992371, 31309422771, 467200878771, 7441464174771, 126003940206771, 2260128508782771, 42808495311726771, 853775831370606771 (list; graph; listen)
OFFSET

1,3

FORMULA

a(1)=0, a(2)=1, a(n) = n * a(n-1) - Sum_{k=1..n-2} a(k).

a(1)=0, n>1 a(n)=(1/3)*(-1+sum(k=0, n, k!)) - Benoit Cloitre (benoit7848c(AT)orange.fr), Nov 12 2005

a(n)=A007489(n)/3 for n>=2 . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Feb 10 2007

MATHEMATICA

a[1]=0; a[2]=1; a[n_Integer] := n*a[n-1]-Sum[a[k], {k, 1, n-2}]; Table[a[n], {n, 1, 22}]

CROSSREFS

Cf. A003422.

Sequence in context: A132006 A020043 A113712 this_sequence A007047 A129097 A014510

Adjacent sequences: A056196 A056197 A056198 this_sequence A056200 A056201 A056202

KEYWORD

easy,nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Sept 26, 1996.

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research