Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A086325
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A086325 Let u(1)=0, u(2)=1, u(k)=u(k-1)+u(k-2)/(k-2); then a(n)=n!*u(n). +0
1
0, 2, 6, 36, 220, 1590, 12978, 118664, 1201464, 13349610, 161530270, 2114578092, 29780308116, 448995414686, 7215997736010, 123153028027920, 2224451568754288, 42395429898611154, 850263899633257014 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n) = ceiling(n*n!/e) - (1-(-1)^n)/2.

E.g.f.: x^2*exp(-x)/(1-x)^2. - Vladeta Jovovic (vladeta(AT)Eunet.yu), Nov 20 2003

MAPLE

a:=n->sum((n+1)!*sum((-1)^k/k!, j=1..n-k), k=0..n): seq(a(n), n=0..18); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 03 2007

a:=n->n!*sum((-1)^k/k!, k=0..n): seq(a(n)*n, n=1..19); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Dec 18 2007

with (combstruct):with (combinat):a:=proc(m) [ZL, {ZL=Set(Cycle(Z, card>=m))}, labeled]; end: ZLL:=a(2):seq(count(ZLL, size=n)*fibonacci(2, n), n=1..19); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 11 2008

with (combstruct):a:=proc(m) [ZL, {ZL=Set(Cycle(Z, card>=m))}, labeled]; end: ZLL:=a(2):seq(count(ZLL, size=n)*n, n=1..19); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 11 2008

CROSSREFS

Cf. A000246.

Cf. A000274.

Cf. A000166.

Sequence in context: A130874 A019020 A101609 this_sequence A074424 A002868 A002869

Adjacent sequences: A086322 A086323 A086324 this_sequence A086326 A086327 A086328

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 30 2003

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