login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A227094 Binomial transform of A013999. 0

%I #16 Nov 02 2023 10:00:50

%S 1,2,5,18,91,574,4199,34650,318645,3237034,36041657,436713506,

%T 5722676895,80654047942,1216703923147,19562850695690,333991034593833,

%U 6034449711055890,115036771019660269,2307582082535387570,48588759062255598563,1071533741191907032590

%N Binomial transform of A013999.

%F a(n) = sum(C(n,k)*A013999(k), k=0..n).

%F G.f.: sum(k!*x^(k-1)*(1-2*x)^k/(1-x)^(2*k), k>=1).

%F a(n) ~ n * n!. - _Vaclav Kotesovec_, Nov 02 2023

%p a:= proc(n) option remember; `if`(n<4, [1, 2, 5, 18][n+1],

%p (n+6)*a(n-1)-(5*n+7)*a(n-2)+(8*n-7)*a(n-3)-(4*n-12)*a(n-4))

%p end:

%p seq(a(n), n=0..30); # _Alois P. Heinz_, Jul 01 2013

%t a[n_] := a[n] = If[n < 4, {1, 2, 5, 18}[[n + 1]], (n + 6)*a[n - 1] - (5*n + 7)*a[n - 2] + (8*n - 7)*a[n - 3] - (4*n - 12)*a[n - 4]];

%t Table[a[n], {n, 0, 30}] (* _Jean-François Alcover_, Jun 04 2018, from Maple *)

%o (Maxima) f(n):=sum(binomial(n-k+1,k)*(-1)^k*(n-k+1)!, k, 0, floor((n+1)/2)); a(n):=sum(binomial(n,k)*f(k), k, 0, n); makelist(a(n), n,0,20);

%Y Cf. A013999.

%K nonn

%O 0,2

%A _Emanuele Munarini_, Jul 01 2013

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 20:26 EDT 2024. Contains 371781 sequences. (Running on oeis4.)