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!)
A262020 Inverse binomial transform of double factorial n!! = A006882(n). 2
1, 0, 1, -1, 5, -11, 43, -127, 489, -1693, 6771, -26071, 109693, -457757, 2028671, -9039931, 42101329, -198411489, 967906675, -4791497559, 24401815141, -126243354637, 669094876055, -3603105436163, 19818039219577, -110721426757801, 630419303537115 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,5
LINKS
FORMULA
E.g.f.: (2*exp(x^2/2)*x+2+sqrt(2*Pi)*exp(x^2/2)*erf(x/sqrt(2))*x) / (2*exp(x)).
a(n) = (n-2)*a(n-3)+(n-1)*a(n-2)-2*a(n-1) for n>2, a(n) = (n-1)^2 otherwise.
a(n) = Sum_{k=0..n} (-1)^k * C(n,k) * A006882(n-k).
a(n) ~ (-1)^n * (sqrt(Pi) - sqrt(2)) * exp(sqrt(n) - n/2 - 1/4) * n^((n+1)/2) / 2. - Vaclav Kotesovec, Oct 31 2017
G.f.: Sum_{k>=0} k!!*x^k/(1 + x)^(k+1). - Ilya Gutkovskiy, Apr 12 2019
MAPLE
a:= proc(n) option remember; `if`(n<3, (n-1)^2,
(n-2)*a(n-3) +(n-1)*a(n-2) -2*a(n-1))
end:
seq(a(n), n=0..30);
MATHEMATICA
Table[Sum[(-1)^(n-k) * Binomial[n, k] * k!!, {k, 0, n}], {n, 0, 30}] (* Vaclav Kotesovec, Oct 31 2017 *)
CROSSREFS
Cf. A000166 (the same for n!), A006882, A263529.
Sequence in context: A129015 A209976 A141355 * A222368 A333114 A276300
KEYWORD
sign
AUTHOR
Alois P. Heinz, Oct 22 2015
STATUS
approved

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 19 15:11 EDT 2024. Contains 371794 sequences. (Running on oeis4.)