91200
domain: N
Appears in sequences
- T(n,4), array T as in A050186; a count of aperiodic binary words.at n=36A050189
- Least number m such that cardinality of InvPhi(m) = prime(n).at n=30A071389
- a(n) = 8*(n-1)*(n-2)*(n-3)*(6*n^2-37*n+60).at n=6A134241
- Numbers with prime factorization pqr^2s^6.at n=18A190474
- Number of n X 5 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=30A208376
- Triangle read by rows: T(n,k), n>=1, k>=1, in which column k lists the numbers of A210843 multiplied by A000330(k), and the first element of column k is in row A000217(k).at n=41A249120
- Number of squares in 3-dimensional space whose four vertices have coordinates (x,y,z) in the set {1,...,n}.at n=12A334881
- Number of even divisors of n!.at n=22A337257
- T(n, k) = [x^k] M(n)*Sum_{k=0..n} E2(n, k)*binomial(-x + n - k, 2*n), where E2 are the second-order Eulerian numbers A340556 and M(n) are the Minkowski numbers A053657. Triangle read by rows, T(n, k) for n >= 0 and 0 <= k <= 2*n+1.at n=26A341111
- a(n) = A351477(n) * FA where F is the Fermat point of a primitive integer-sided triangle ABC with A < B < C < 2*Pi/3 and FA + FB + FC = A336329(n).at n=6A351801