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.

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

This page as a plain text file.
%I A325593 #20 Sep 25 2024 09:55:40
%S A325593 1,6,20,30,56,60,90,105,120,210,252,360,420,462,495,504,560,630,720,
%T A325593 756,840,990,1260,1320,1365,1540,1680,1716,1980,2520,2970,3003,3360,
%U A325593 3960,4290,4620,5040,5460,6006,6435,7140,7560,7920,8190,9240,10080,10296,10626
%N A325593 Numbers having at least three representations as multinomial coefficients M(n;lambda), where lambda is a partition of n.
%C A325593 Numbers occurring at least three times in the triangle A036038.
%H A325593 Pontus von Brömssen, <a href="/A325593/b325593.txt">Table of n, a(n) for n = 1..10000</a> (first 505 terms from Alois P. Heinz)
%e A325593 1 is in the sequence because M(0;0) = M(1;1) = M(2;2) = M(3;3) = ... = 1.
%e A325593 6 is in the sequence because M(6;5,1) = M(4;2,2) = M(3;1,1,1) = 6.
%e A325593 56 is in the sequence because M(56;55,1) = M(8;5,3) = M(8;6,1,1) = 56.
%Y A325593 Cf. A036038, A325472, A325903, A376370.
%Y A325593 A376373 is a subsequence.
%K A325593 nonn
%O A325593 1,2
%A A325593 _Alois P. Heinz_, Sep 06 2019