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.

A243746 Number of compositions of n^2 with exactly n occurrences of the largest part.

Original entry on oeis.org

1, 1, 1, 21, 686, 108598, 134190162, 581266801787, 7792898359869376, 343349252968004533986, 60917528224825622999788393, 57691110936849283646013592507915, 280564704602761525363382338982479319450, 5619591974217690324311922622790661532819536973
Offset: 0

Views

Author

Alois P. Heinz, Jun 09 2014

Keywords

Examples

			a(3) = 21: 333, 111222, 112122, 112212, 112221, 121122, 121212, 121221, 122112, 122121, 122211, 211122, 211212, 211221, 212112, 212121, 212211, 221112, 221121, 221211, 222111.
		

Crossrefs

Cf. A238341.

Programs

  • Maple
    b:= proc(n, p, i) option remember; `if`(n=0, p!,
          `if`(i<1, 0, add(b(n-i*j, p+j, i-1)/j!, j=0..n/i)))
        end:
    a:= n-> add(b(n^2-i*n, n, i-1)/n!, i=0..n):
    seq(a(n), n=0..15);
  • Mathematica
    b[n_, p_, i_] := b[n, p, i] = If[n == 0, p!,
         If[i < 1, 0, Sum[b[n - i*j, p + j, i - 1]/j!, {j, 0, n/i}]]];
    a[n_] := Sum[b[n^2 - i*n, n, i - 1]/n!, {i, 0, n}];
    Table[a[n], {n, 0, 15}] (* Jean-François Alcover, Mar 04 2022, after Alois P. Heinz *)

Formula

a(n) = A238341(n^2,n).