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.

A376663 Largest frequency of n in the multiset of multinomial coefficients k!/(x_1! * ... * x_j!) with 1 <= x_1 <= ... <= x_j for a fixed k = x_1 + ... + x_j, i.e., maximum number of times that n appears in a row of A036038.

This page as a plain text file.
%I A376663 #12 Oct 07 2024 00:45:49
%S A376663 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
%T A376663 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,1,1,
%U A376663 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1
%N A376663 Largest frequency of n in the multiset of multinomial coefficients k!/(x_1! * ... * x_j!) with 1 <= x_1 <= ... <= x_j for a fixed k = x_1 + ... + x_j, i.e., maximum number of times that n appears in a row of A036038.
%H A376663 Pontus von Brömssen, <a href="/A376663/b376663.txt">Table of n, a(n) for n = 1..10000</a>
%e A376663 56 appears twice in row 8 of A036038 (and never more than twice in the same row): 56 = 8!/(1!*1!*6!) = 8!/(3!*5!). Hence, a(56) = 2.
%Y A376663 Cf. A036038, A376369, A376661, A376664, A376665 (records), A376666 (indices of records), A376667.
%K A376663 nonn
%O A376663 1,56
%A A376663 _Pontus von Brömssen_, Oct 02 2024