|
|
A001517
|
|
Bessel polynomials y_n(x) (see A001498) evaluated at 2.
(Formerly M3062 N1240)
|
|
29
|
|
|
1, 3, 19, 193, 2721, 49171, 1084483, 28245729, 848456353, 28875761731, 1098127402131, 46150226651233, 2124008553358849, 106246577894593683, 5739439214861417731, 332993721039856822081, 20651350143685984386753
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Numerators of successive convergents to e using continued fraction 1 + 2/(1 + 1/(6 + 1/(10 + 1/(14 + 1/(18 + 1/(22 + 1/26 + ...)))))).
Number of ways to use the elements of {1,...,k}, n <= k <= 2n, once each to form a collection of n lists, each having length 1 or 2. - Bob Proctor, Apr 18 2005, Jun 26 2006
|
|
REFERENCES
|
L. Euler, 1737.
I. S. Gradshteyn and I. M. Ryzhik, Tables of Integrals, Series and Products, 6th ed., Section 0.126, p. 2.
J. Riordan, Combinatorial Identities, Wiley, 1968, p. 77.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
FORMULA
|
a(n) = Sum_{k=0..n} (n+k)!/(k!*(n-k)!) = (e/Pi)^(1/2) K_{n+1/2}(1/2).
D-finite with recurrence a(n) = (4*n-2)*a(n-1) + a(n-2), n >= 2.
G.f.: 1/Q(0), where Q(k) = 1 - x - 2*x*(k+1)/Q(k+1); (continued fraction). - Sergei N. Gladkovskii, May 17 2013
a(n) = (1/n!)*Integral_{x>=0} (x*(1 + x))^n*exp(-x) dx. Expansion of exp(x) in powers of y = x*(1 - x): exp(x) = 1 + y + 3*y^2/2! + 19*y^3/3! + 193*y^4/4! + 2721*y^5/5! + .... - Peter Bala, Dec 15 2013
a(n) = exp(1/2) / sqrt(Pi) * BesselK(n+1/2, 1/2). - Vaclav Kotesovec, Mar 15 2014
a(n) = hypergeom([-n, n+1], [], -1). - Peter Luschny, Oct 17 2014
a(n) = (1/2)_{n} * 4^n * hypergeometric1f1(-n; -2*n; 1).
G.f.: (1/(1-t))*hypergeometric2f0(1, 1/2; -; 4*t/(1-t)^2). (End)
a(n) = Sum_{k=0..n} binomial(n,k)*binomial(n+k,k)*k!. - Ilya Gutkovskiy, Nov 24 2017
|
|
MAPLE
|
A:= gfun:-rectoproc({a(n) = (4*n-2)*a(n-1) + a(n-2), a(0)=1, a(1)=3}, a(n), remember):
f:=proc(n) option remember; if n = 0 then 1 elif n=1 then 3 else f(n-2)+(4*n-2)*f(n-1); fi; end;
seq(simplify(KummerU(-n, -2*n, 1)), n = 0..16); # Peter Luschny, May 10 2022
|
|
MATHEMATICA
|
|
|
PROG
|
(PARI) a(n)=sum(k=0, n, (n+k)!/k!/(n-k)!)
(Sage)
A001517 = lambda n: hypergeometric([-n, n+1], [], -1)
|
|
CROSSREFS
|
Replace "lists" with "sets" in comment: A001515.
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|