The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A052144 a(n) = A000172(n)^2. 4
1, 4, 100, 3136, 119716, 5071504, 230553856, 11016601600, 546360462244, 27888242788624, 1456587070867600, 77515424509446400, 4189899499315360000, 229472379264509977600, 12709952101698593689600, 710863065714510068187136 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
REFERENCES
R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see page 191.
LINKS
FORMULA
P-recursive: P(n-1)*n^4*a(n) = P(n)*Q(n)*a(n-1) + 8*P(n-1)*Q(n)*a(n-2) - 512*P(n)*(n-2)^4*a(n-3), where P(n) = 7*n^2 - 7*n + 2 and Q(n) = 57*n^4 - 228*n^3 + 321*n^2 - 186*n + 40 with a(0) = 1, a(1) = 4 and a(2) = 100. - Peter Bala, Feb 01 2024
a(n) ~ 2^(6*n+2) / (3*Pi^2*n^2). - Vaclav Kotesovec, Feb 02 2024
MATHEMATICA
A052144[n_] := HypergeometricPFQ[{-n, -n, -n}, {1, 1}, -1]^2;
Array[A052144, 20, 0] (* Paolo Xausa, Jan 30 2024, after Jean-François Alcover in A000172 *)
CROSSREFS
Cf. A000172.
Sequence in context: A365608 A244352 A173987 * A165518 A127776 A266524
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Jan 23 2000
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 May 14 00:47 EDT 2024. Contains 372528 sequences. (Running on oeis4.)