|
|
A000275
|
|
Coefficients of a Bessel function (reciprocal of J_0(z)); also pairs of permutations with rise/rise forbidden.
(Formerly M3065 N1242)
|
|
28
|
|
|
1, 1, 3, 19, 211, 3651, 90921, 3081513, 136407699, 7642177651, 528579161353, 44237263696473, 4405990782649369, 515018848029036937, 69818743428262376523, 10865441556038181291819, 1923889742567310611949459, 384565973956329859109177427, 86180438505835750284241676121
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
a(n) has the Lucas property, namely a(n) is congruent to a(n_0)a(n_1)...a(n_k) modulo p for any prime p where n_0,n_1,... are the base p digits of n. (Carlitz via McIntosh)
|
|
REFERENCES
|
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_{r=0..n-1} (-1)^(r+n+1) binomial(n, r)^2 a(r), if n > 0.
Sum_{n>=0} a(n) * x^n / n!^2 = 1 / J_0(sqrt(4*x)). - _Michael Somos, May 17 2004
Conjectural formula: 1 = Sum_{n>=0} a(n)*x^n*Sum_{k>=0} binomial(n+k,k)^2*(-x)^k.
Apart from the initial term, first column of A192721. (End)
E.g.f.: 1/J_0(sqrt(4*x)) = 1 + x/Q(0), where Q(k) = (k+1)^2 - x + (k+1)^2*x/Q(k+1); (continued fraction). - Sergei N. Gladkovskii, Dec 06 2013
a(n) ~ c * (n!)^2 / r^n, where r = (1/4)*BesselJZero[0,1]^2 = 1.4457964907366961302939989396139517587678604516... and c = 1/(sqrt(r) * BesselJ(1, 2*sqrt(r))) = 1.60197469692804662664846689139151227422675123376219... - Vaclav Kotesovec, Mar 02 2014, updated Apr 01 2018
|
|
EXAMPLE
|
a(3) = 19: The 19 pairs of permutations in the group S_3 x S_3 with no common rises correspond to the zero entries in the table below.
======================================
Number of common rises in S_3 x S_3
======================================
| 123 132 213 231 312 321
======================================
123| 2 1 1 1 1 0
132| 1 1 0 1 0 0
213| 1 0 1 0 1 0
231| 1 1 0 1 0 0
312| 1 0 1 0 1 0
321| 0 0 0 0 0 0
(End)
G.f. = 1 + x + 3*x^2 + 19*x^3 + 211*x^4 + 3651*x^5 + 90921*x^6 + ...
|
|
MAPLE
|
A000275 := proc(n) sum(z^k/k!^2, k = 0..infinity);
series(%^x, z=0, n+1): n!^2*coeff(%, z, n); add(abs(coeff(%, x, k)), k=0..n) end:
|
|
MATHEMATICA
|
a[0] = 1; a[n_] := a[n] = Sum[(-1)^(r+n+1)*Binomial[n, r]^2 a[r], {r, 0, n-1}]; Table[a[n], {n, 0, 17}] (* Jean-François Alcover, Aug 05 2013 *)
CoefficientList[Series[1/BesselJ[0, Sqrt[4*x]], {x, 0, 20}], x]* Range[0, 20]!^2 (* Vaclav Kotesovec, Mar 02 2014 *)
a[ n_] := If[ n < 0, 0, (n! 2^n)^2 SeriesCoefficient[ 1 / BesselJ[ 0, x], {x, 0, 2 n}]]; (* Michael Somos, Aug 20 2015 *)
|
|
PROG
|
(PARI) {a(n) = if( n<0, 0, n!^2 * 4^n * polcoeff( 1 / besselj(0, x + x * O(x^(2*n))), 2*n))}; /* Michael Somos, May 17 2004 */
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|