450450

Appears in sequences

• Number of orbits of length n under the map whose periodic points are counted by A000364.at n=5A060164
• Bessel polynomial {y_n}'''(0).at n=12A065949
• a(1)=1; for n > 0, a(n+1) = rad(a(n))*n where rad=A007947.at n=15A066332
• Triangle T(n,k), n >= 0, 0 <= k <= n, read by rows. Let A(n,k) be the triangle in A097474. Then T(n,k) is defined by the orthogonality relations Sum_{j=i..r} T(r,j)*A(j,i)*2^-floor((j+3)/2) = 0 if i != r, = (2r+1)!/(r!*2^r) if i = r.at n=22A097749
• a(n) = binomial(n+4,4) * binomial(n+8,4).at n=7A104475
• a(n) = binomial(n+7,n)*binomial(n+11,n).at n=4A105254
• Cubefree part of n!.at n=12A145642
• Numbers with exactly 6 distinct prime divisors {2,3,5,7,11,13}.at n=14A147573
• Numbers with prime factorization pqrst^2u^2.at n=15A190380
• Triangle read by rows: T(n,k) (n>=2, 1<=k<=n-1) is the number of unordered pairs of vertices at distances k in the odd graph O_n.at n=19A228308
• Triangle read by rows: T(n, k) = v(n, k)*((1/v(n, k)) mod prime(k)), where v(n, k) = (Product_{j=1..n} prime(j))/prime(k), n >= 1, 1 <= k <= n.at n=27A240673
• Number of length 1+4 0..n arrays with no five consecutive terms having the maximum of any two terms equal to the minimum of the remaining three terms.at n=12A249845
• Triangle T(n,k) = C(n+k-1,k)*C(2*n-1,n-k).at n=40A258758
• Triangle read by rows, expansion of e.g.f. exp(x*(cos(z) + cosh(z) - 2)/2), nonzero coefficients of z.at n=13A291452
• Triangle read by rows: T(n,k) = (3*n - 2*k)!/((n-k)!^3*k!).at n=16A318107
• Irregular triangle read by rows in which the n-th row lists multinomials for partitions of 4n which have only parts which are multiples of 4, in Hindenburg order.at n=10A327004
• a(n) = (3*n + 1)!/(n!)^3.at n=4A331322
• Triangle read by rows: T(n,k) = (-1)^(n+k)*(n+k+1)*binomial(n,k)*binomial(n+k,k) for n >= k >= 0.at n=40A331431
• Numbers k with property that k is the least logarithmically smooth numbers (meaning largest prime factor of k is less than log(k)) having squarefree kernel equal to squarefree kernel of k.at n=39A333961
• Numbers with a record number of deficient divisors.at n=39A335542