cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A338727 a(n) = C(n+1)^2 - 2*C(n+1)*C(n) + C(n)^2, where C() is a Catalan number.

Original entry on oeis.org

1, 1, 9, 81, 784, 8100, 88209, 1002001, 11778624, 142420356, 1763160100, 22268399076, 286105172544, 3730846771600, 49286086364025, 658580586980625, 8890060997894400, 121099761397088100, 1663131325207760100, 23009839285003272900, 320486852887891560000, 4491184012659823424400, 63291012091734041000100
Offset: 0

Views

Author

N. J. A. Sloane, Nov 30 2020

Keywords

Crossrefs

Equals A000245(n) squared for n >= 1.

Programs

Formula

D-finite with recurrence (n+2)^2*(n-1)^2*a(n) -4*n^2*(2*n-1)^2*a(n-1)=0. - R. J. Mathar, Dec 11 2020
a(n) = A213600(2n,2) for n>=1. - Alois P. Heinz, Oct 07 2022