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.

A362967 Number of nondecreasing partitions of n^2 into n parts from the intervals [1,n], [2,n+1], ..., [n,2n-1], respectively.

Original entry on oeis.org

1, 1, 2, 5, 17, 66, 294, 1393, 6965, 36111, 192850, 1053894, 5871306, 33234990, 190704140, 1107086841, 6492325565, 38412063755, 229052915708, 1375396927729, 8310509070747, 50496841617102, 308394124109340, 1892137615326526, 11658149626059204, 72108088307308032, 447590893613564372
Offset: 0

Views

Author

Max Alekseyev, Jun 16 2023

Keywords

Comments

a(n) <= A039744(n); a(n) <= A077045(n); a(n) >= A019589(n).

Crossrefs

Programs

  • Sage
    def a362967(n): return Partitions(n^2, length=n, inner=range(n,0,-1), outer=range(2*n-1,n-1,-1)).cardinality()