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.

Showing 1-3 of 3 results.

A325472 Numbers having at least two representations as multinomial coefficients M(n;lambda), where lambda is a partition of n.

Original entry on oeis.org

1, 6, 10, 12, 15, 20, 21, 24, 28, 30, 35, 36, 42, 45, 55, 56, 60, 66, 70, 72, 78, 84, 90, 91, 105, 110, 120, 126, 132, 136, 140, 153, 156, 165, 168, 171, 180, 182, 190, 210, 220, 231, 240, 252, 253, 272, 276, 280, 286, 300, 306, 325, 330, 336, 342, 351, 360
Offset: 1

Views

Author

Alois P. Heinz, Sep 06 2019

Keywords

Comments

Numbers that are repeated in the triangle A036038 (all positive integers occur at least once).
All triangular numbers (A000217) except 0 and 3 are in this sequence.

Examples

			1 is in the sequence because M(0;0) = M(1;1) = M(2;2) = M(3;3) = ... = 1.
6 is in the sequence because M(6;5,1) = M(4;2,2) = M(3;1,1,1) = 6.
42 is in the sequence because M(42;41,1) = M(7;5,1,1) = 42.
		

Crossrefs

Formula

a(n) = A305188(n-1) for n > 1.

A309992 Triangle T(n,k) whose n-th row lists in increasing order the multinomial coefficients M(n;lambda), where lambda ranges over all partitions of n into distinct parts; n >= 0, 1 <= k <= A000009(n), read by rows.

Original entry on oeis.org

1, 1, 1, 1, 3, 1, 4, 1, 5, 10, 1, 6, 15, 60, 1, 7, 21, 35, 105, 1, 8, 28, 56, 168, 280, 1, 9, 36, 84, 126, 252, 504, 1260, 1, 10, 45, 120, 210, 360, 840, 1260, 2520, 12600, 1, 11, 55, 165, 330, 462, 495, 1320, 2310, 4620, 6930, 27720
Offset: 0

Views

Author

Alois P. Heinz, Aug 26 2019

Keywords

Comments

First row with repeated terms is row 15, see also A309999: 1365 = M(15;11,4) = M(15;12,2,1) and 30030 = M(15;9,5,1) = M(15;10,3,2).

Examples

			For n = 5 there are 3 partitions of 5 into distinct parts: [5], [4,1], [3,2].  So row 5 contains M(5;5) = 1, M(5;4,1) = 5 and M(5;3,2) = 10.
Triangle T(n,k) begins:
  1;
  1;
  1;
  1,  3;
  1,  4;
  1,  5, 10;
  1,  6, 15,  60;
  1,  7, 21,  35, 105;
  1,  8, 28,  56, 168, 280;
  1,  9, 36,  84, 126, 252, 504, 1260;
  1, 10, 45, 120, 210, 360, 840, 1260, 2520, 12600;
  1, 11, 55, 165, 330, 462, 495, 1320, 2310,  4620, 6930, 27720;
  ...
		

Crossrefs

Columns k=1-3 give: A000012, A000027 (for n>=3), A000217(n-1) (for n>=5).
Row sums give A007837.
Rightmost terms of rows give A290517.

Programs

  • Maple
    g:= proc(n, i) option remember; `if`(i*(i+1)/2binomial(n, i)*x, g(n-i, min(n-i, i-1)))[], g(n, i-1)[]]))
        end:
    T:= n-> sort(g(n$2))[]:
    seq(T(n), n=0..14);
  • Mathematica
    g[n_, i_] := g[n, i] = If[i(i+1)/2 < n, {}, If[n == 0, {1}, Join[ Binomial[n, i] # & /@ g[n-i, Min[n-i, i-1]], g[n, i-1]]]];
    T[n_] := Sort[g[n, n]];
    T /@ Range[0, 14] // Flatten (* Jean-François Alcover, Jan 27 2021, after Alois P. Heinz *)

A325903 Numbers having at least three representations as multinomial coefficients M(n;lambda), where lambda is a partition of n into distinct parts.

Original entry on oeis.org

1, 105, 120, 210, 495, 1260, 1365, 1540, 3003, 4620, 5460, 6435, 7140, 10296, 11628, 15504, 24310, 27720, 29260, 30030, 42504, 43680, 45045, 77520, 83160, 102960, 116280, 120120, 180180, 203490, 352716, 360360, 376740, 437580, 593775, 657800, 680680, 720720
Offset: 1

Views

Author

Alois P. Heinz, Sep 07 2019

Keywords

Comments

Numbers occurring at least three times in the triangle A309992.
All terms are contained in A325593 and in A325901.

Examples

			1 is in the sequence because M(0;0) = M(1;1) = M(2;2) = M(3;3) = ... = 1.
105 is in the sequence because M(7;4,2,1) = M(15;13,2) = M(105;104,1) = 105.
120 is in the sequence because M(10;7,3) = M(16;14,2) = M(120;119,1) = 120.
1365 is in the sequence because M(15;11,4) = M(15;12,2,1) = M(1365;1364,1) = 1365.
		

Crossrefs

Showing 1-3 of 3 results.