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.

A115722 Table of Durfee square of partitions in Mathematica order.

Original entry on oeis.org

0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 2, 1, 2, 2, 1, 2, 2, 1, 1, 1, 1, 2, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 1, 1, 1, 1, 2, 1, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 1, 1, 1, 1, 2, 1, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 3, 2, 2, 2, 2, 2, 1, 2, 2, 2, 1, 1, 1, 1, 2, 1, 2, 2, 1, 2
Offset: 0

Views

Author

Keywords

Examples

			First few rows:
0;
1,1;
1,1,1;
1,1,2,1,1;
1,1,2,1,2,1,1;
		

Crossrefs

Row lengths A000041, totals A115995.

Programs

  • Mathematica
    {0}~Join~Array[Map[Block[{k = Length@ #}, While[Nand[k > 0, AllTrue[Take[#, k], # >= k &]], k--]; k] &, IntegerPartitions@ #] &, 10] // Flatten (* Michael De Vlieger, Jan 17 2020 *)

Formula

If partition is laid out in descending order p(1),p(2),...,p(k) without repetition factors (e.g. [3,2,2,1,1,1]), a(P) = max_k min(k,p(k)).