261360

Appears in sequences

• Triangle whose (i,j)-th entry is binomial(i,j)*6^(i-j)*11^j.at n=17A038265
• Triangle whose (i,j)-th entry is binomial(i,j)*11^(i-j)*6^j.at n=18A038320
• Denominators of continued fraction convergents to sqrt(717).at n=11A042381
• a(n) = maximal value of C(i, j) * C(n-j, n-i) for 0 <= j <= i <= n.at n=15A094291
• Maximal number of longest common subsequences between any two binary strings of length n (Version 1).at n=15A094837
• Fifth column of triangle A103371 (without leading zeros).at n=7A134287
• a(n) = sqrt( binomial(4n,0) * binomial(4n,1) * ... * binomial(4n,2n-1) ).at n=3A165975
• A lower bound for A094837.at n=15A171003
• Binomial(n-k-1,k) * binomial(n-k,k+1) where k = ceiling(n/4).at n=16A171006
• Array to be read by rows: Number of ways of placing n rods of length L in a LxLxL simple cubic lattice without any two rods intersecting. (Consecutive rows are for L>=0; in each row, 0<=n<=L^2.)at n=29A185697
• Consider coefficients U(m,L,k) defined by the identity Sum_{k=1..L} Sum_{j=0..m} A302971(m,j)/A304042(m,j) * k^j * (T-k)^j = Sum_{k=0..m} (-1)^(m-k) * U(m,L,k) * T^k that holds for all positive integers L,m,T. This sequence gives 3-column table read by rows, where the n-th row lists coefficients U(2,n,k) for k = 0, 1, 2; n >= 1.at n=31A316349
• Expansion of 60*x*(1 + 4*x + x^2) / (1 - x)^5.at n=10A316458
• Numbers with exactly four distinct exponents in their prime factorization, or four distinct parts in their prime signature.at n=20A323025