login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005443 a(n) = n! * Fibonacci(n).
(Formerly M2034)
5
0, 1, 2, 12, 72, 600, 5760, 65520, 846720, 12337920, 199584000, 3552595200, 68976230400, 1450895846400, 32866215782400, 797681364480000, 20650793619456000, 568032822669312000, 16543733655601152000 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

REFERENCES

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

LINKS

Table of n, a(n) for n=0..18.

P. R. J. Asveld & N. J. A. Sloane, Correspondence, 1987

P. R. J. Asveld, Fibonacci-like differential equations with a polynomial nonhomogeneous term, Fib. Quart. 27 (1989), 303-309.

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 511

FORMULA

a(n) = A039948(n, 1).

E.g.f.: x/(1-x-x^2). - Geoffrey Critzer, Sep 01 2013

MAPLE

ZL:=[S, {a = Atom, b = Atom, S = Prod(X, Sequence(Prod(X, b))), X = Sequence(b, card >= 1)}, labelled]: seq(combstruct[count](ZL, size=n), n=0..18); # Zerinvary Lajos, Mar 26 2008

MATHEMATICA

Table[Fibonacci[n]*n!, {n, 0, 25}] (* Zerinvary Lajos, Jul 09 2009 *)

PROG

(PARI) a(n) = n!*fibonacci(n); \\ Michel Marcus, Oct 30 2015

CROSSREFS

Sequence in context: A277490 A296975 A144086 * A002867 A235359 A130426

Adjacent sequences:  A005440 A005441 A005442 * A005444 A005445 A005446

KEYWORD

nonn,easy

AUTHOR

Simon Plouffe

EXTENSIONS

More terms from James A. Sellers, Dec 24 1999

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 13 00:25 EST 2019. Contains 329083 sequences. (Running on oeis4.)