39330
domain: N
Appears in sequences
- Number of n-step self-avoiding walks on f.c.c. lattice from (0,0,0) to (0,3,3).at n=4A005546
- Numbers of espalier polycubes of a given volume in dimension 5.at n=26A229925
- Number of n X n 0..1 arrays with every repeated value in every row and column greater than or equal to the previous repeated value.at n=3A267728
- Number of nX4 0..1 arrays with every repeated value in every row and column greater than or equal to the previous repeated value.at n=3A267731
- T(n,k)=Number of nXk 0..1 arrays with every repeated value in every row and column greater than or equal to the previous repeated value.at n=24A267735
- Expansion of Product_{k>=1} ((1 + x^(k^2)) / (1 - x^(k^2)))^k.at n=47A291667
- Number of nX3 0..1 arrays with every element equal to 1, 2, 3 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=6A300607
- Number of nX7 0..1 arrays with every element equal to 1, 2, 3 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=2A300611
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=38A300612
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=42A300612
- a(n) = 1*2*3*4*5*6*7*8 - 9*10*11*12*13*14*15*16 + 17*18*19*20*21*22*23*24 - ... + (up to n).at n=10A319549
- Those primitive elements of A337386 that have exactly one primitive nondeficient divisor (A006039).at n=15A341604