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.

A060545 a(n) = binomial(n^2, n)/n.

Original entry on oeis.org

1, 3, 28, 455, 10626, 324632, 12271512, 553270671, 28987537150, 1731030945644, 116068178638776, 8634941152058949, 705873715441872264, 62895036884524942320, 6067037854078498539696, 629921975126394617164575, 70043473196734767582082230
Offset: 1

Views

Author

Henry Bottomley, Apr 02 2001

Keywords

Crossrefs

Programs

Formula

a(n) = A060543(n, n) = A014062(n)/n.
a(n+1) = C(A005563(n), n) for n >= 0. - Fred Daniel Kline, Sep 27 2016
From Peter Bala, Oct 22 2023: (Start)
a(p^r) == 1 (mod p^(3+r)) for all positive integers r and all primes p >= 5 (apply Meštrović, Remark 17, p. 12).
Conjecture: a(2*p^r) == 4*p^r - 1 (mod p^(3+r)) for all positive integers r and all primes p >= 5. (End)

Extensions

More terms from Fred Daniel Kline, Sep 28 2016