19976

Appears in sequences

• Number of partitions satisfying cn(1,5) <= cn(0,5) + cn(2,5) and cn(1,5) <= cn(0,5) + cn(3,5) and cn(4,5) <= cn(0,5) + cn(2,5) and cn(4,5) <= cn(0,5) + cn(3,5).at n=43A039874
• Consider all integer triples (i,j,k), j >= k > 0, with binomial(i+2,3)=j^3+k^3, ordered by increasing i; sequence gives k values.at n=22A054207
• A triangular sequence of eight back recursive polynomials that are Hermite H(x,n) like and alternating orthogonal on domain {-Infinity,Infinity} and weight function Exp[ -x^2/2]:k=8 P(x, n) = Sum[If[Mod[m, 2] == 1, (m + 1)*x^m*P(x, n - m), n^(m/2)*P(x, n - m)], {m, 1, k}].at n=52A138094
• Number of (n+1) X 2 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock equal to one, and every 2 X 2 determinant nonzero.at n=6A206003
• Number of (n+1)X8 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one, and every 2X2 determinant nonzero.at n=0A206009
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one, and every 2X2 determinant nonzero.at n=21A206010
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one, and every 2X2 determinant nonzero.at n=27A206010
• Number of nX1 0..3 arrays with every row and column least squares fitting to a zero slope straight line, with a single point array taken as having zero slope.at n=9A223819
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 33", based on the 5-celled von Neumann neighborhood.at n=31A269812
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 865", based on the 5-celled von Neumann neighborhood.at n=25A273701
• Numbers k such that Bernoulli number B_{k} has denominator 61410.at n=7A295591
• Triangle read by rows: T(n,k) is the number of achiral combinatorial maps with n edges and k vertices, 1 <= k <= n + 1.at n=39A380617
• Number of integer partitions of n that cannot be partitioned into constant multisets with distinct block-sums.at n=46A381717