37040
domain: N
Appears in sequences
- Number of cyclotomic cosets of 9 mod 10^n.at n=48A220020
- Let P be a one-move "rider" with move set M={(1,2)}; a(n) is the number of non-attacking positions of three indistinguishable pieces P on an n X n board.at n=7A222309
- Number of (n+1)X(3+1) 0..1 arrays x(i,j) with row sums sum{j^3*x(i,j), j=1..3+1} nondecreasing, and column sums sum{i^3*x(i,j), i=1..n+1} nondecreasing.at n=5A232856
- Number of (n+1)X(6+1) 0..1 arrays x(i,j) with row sums sum{j^3*x(i,j), j=1..6+1} nondecreasing, and column sums sum{i^3*x(i,j), i=1..n+1} nondecreasing.at n=2A232859
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays x(i,j) with row sums sum{j^3*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i^3*x(i,j), i=1..n+1} nondecreasing.at n=30A232860
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays x(i,j) with row sums sum{j^3*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i^3*x(i,j), i=1..n+1} nondecreasing.at n=33A232860
- Multiples of 1852.at n=20A303272
- Triangle read by rows: T(n, k) = n! * 3^k * hypergeom([-k], [-n], -2/3).at n=25A375597