111870

Appears in sequences

• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (-1, 1, 1), (0, 0, 1), (1, -1, 0), (1, 0, -1)}.at n=11A148333
• Averages of twin primes such that p1*p2 -+ AverageTwinPrime are primes.at n=19A154668
• Number of permutations of [n] having exactly 9 strong fixed blocks.at n=4A225970
• Number of ways of writing n as the sum of 11 triangular numbers.at n=17A226255
• Number of (n+1)X(4+1) 0..1 arrays x(i,j) with row sums sum{j*x(i,j), j=1..4+1} nondecreasing, and column sums sum{i*x(i,j), i=1..n+1} nondecreasing.at n=4A232828
• Number of (n+1)X(5+1) 0..1 arrays x(i,j) with row sums sum{j*x(i,j), j=1..5+1} nondecreasing, and column sums sum{i*x(i,j), i=1..n+1} nondecreasing.at n=3A232829
• 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=31A232831
• 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=32A232831
• Triangle read by rows: T(n,k) is the number of simple graphs on n labeled vertices with k edges and without endpoints, n >= 0, 0 <= k <= n*(n-1)/2.at n=56A369928