|
%I M2034 #40 Nov 21 2022 01:38:42
%S 0,1,2,12,72,600,5760,65520,846720,12337920,199584000,3552595200,
%T 68976230400,1450895846400,32866215782400,797681364480000,
%U 20650793619456000,568032822669312000,16543733655601152000,508598164809326592000,16458582085314969600000
%N a(n) = n! * Fibonacci(n).
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Seiichi Manyama, <a href="/A005443/b005443.txt">Table of n, a(n) for n = 0..416</a>
%H P. R. J. Asveld & N. J. A. Sloane, <a href="/A005442/a005442.pdf">Correspondence, 1987</a>
%H P. R. J. Asveld, <a href="http://www.fq.math.ca/Scanned/27-4/asveld.pdf">Fibonacci-like differential equations with a polynomial nonhomogeneous term</a>, Fib. Quart. 27 (1989), 303-309.
%H INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=511">Encyclopedia of Combinatorial Structures 511</a>
%F a(n) = A039948(n, 1).
%F E.g.f.: x/(1-x-x^2). - _Geoffrey Critzer_, Sep 01 2013
%F a(n) = n*a(n-1) + n*(n-1)*a(n-2). - _G. C. Greubel_, Nov 20 2022
%p 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
%t Table[Fibonacci[n]*n!, {n, 0, 25}] (* _Zerinvary Lajos_, Jul 09 2009 *)
%o (PARI) a(n) = n!*fibonacci(n); \\ _Michel Marcus_, Oct 30 2015
%o (Magma) [Factorial(n)*Fibonacci(n): n in [0..30]]; // _G. C. Greubel_, Nov 20 2022
%o (SageMath) [fibonaccI9n)*factorial(n) for n in range(31)] # _G. C. Greubel_, Nov 20 2022
%Y Cf. A000045, A000142, A005442, A039948.
%K nonn,easy
%O 0,3
%A _Simon Plouffe_
%E More terms from _James A. Sellers_, Dec 24 1999
|
