60984

Appears in sequences

• a(n) is the number of n-step walks on square lattice such that 0 <= y <= x at each step.at n=11A005558
• If there were a 9-dimensional unimodular lattice with minimal norm 2, this would be its theta series; however, no such lattice exists.at n=11A032800
• Number of antichains (or order ideals) in the poset 5*m*n or plane partitions with not more than m rows, n columns and entries <= 5.at n=38A056941
• Number of antichains (or order ideals) in the poset 5*m*n or plane partitions with not more than m rows, n columns and entries <= 5.at n=42A056941
• Consider iteration of the function f(x) = sigma(phi(x)) = A062402(x). Sequence lists the numbers k such that the trajectory of k returns to k.at n=38A096998
• a(n) = (n+1)*(n+2)^2*(n+3)^2*(n+4)^2*(n+5)^2*(n+6)/86400.at n=6A108679
• Central column of triangle A090181.at n=6A125558
• a(n) = binomial(n+7,7)*binomial(n+7,6)/(n+7).at n=5A134288
• Number of 5 X 6 matrices with elements in 0..n with each row and each column in nondecreasing order. 5,6,n can be permuted, see formula.at n=2A140905
• Triangle T(n,m) read by rows: T(n,m) = Product_{i=0..5} binomial(n+i,m)/binomial(m+i,m).at n=30A142465
• Triangle T(n,m) read by rows: T(n,m) = Product_{i=0..5} binomial(n+i,m)/binomial(m+i,m).at n=33A142465
• Triangle T(n,k) = binomial(n, k)*(k! + (n-k)!), read by rows.at n=48A155162
• Triangle T(n,k) = binomial(n, k)*(k! + (n-k)!), read by rows.at n=51A155162
• Numbers n such that n^2 contains every decimal digit exactly once.at n=35A156977
• Number of 2-step self-avoiding walks on an n X n X n cube summed over all starting positions.at n=21A187163
• Numbers with prime factorization p*q^2*r^2*s^3 (where p, q, r, s are distinct primes).at n=25A190109
• Monotonic ordering of set S generated by these rules: if x and y are in S and x^2-y^2>0 then x^2-y^2 is in S, and 2 and 3 are in S.at n=33A192648
• Number of n X n 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=6A208374
• Number of n X 7 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=6A208378
• Number of 7 X n 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=6A208383