111609

Appears in sequences

• Number of (n+1)X(3+1) 0..1 arrays x(i,j) with row sums sum{j*x(i,j), j=1..3+1} nondecreasing, and column sums sum{i*x(i,j), i=1..n+1} nondecreasing.at n=6A232827
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays x(i,j) with row sums sum{j*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i*x(i,j), i=1..n+1} nondecreasing.at n=38A232831
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays x(i,j) with row sums sum{j*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i*x(i,j), i=1..n+1} nondecreasing.at n=42A232831
• Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 846", based on the 5-celled von Neumann neighborhood.at n=16A284297
• Odd numbers k, not powers of primes, such that sigma(k) == 2 modulo 8 and sigma(sigma(k)) == 6 modulo 8.at n=20A332458