246960

Appears in sequences

• a(n) = n^2 * n!.at n=7A002775
• Triangle of numbers a(n,k) = number of terms in n X n determinant with 2 adjacent diagonals of k and k-1 0's (0<=k<=n).at n=47A047922
• Numbers that can be written as k/d(k) in four or more ways, where d(k) = number of divisors of k.at n=26A051346
• a(n) is least N > 1 congruent to -1,0, or 1 mod i for all i=1,...,n.at n=16A056697
• a(n) is least N > 1 congruent to -1,0, or 1 mod i for all i=1,...,n.at n=17A056697
• a(n) = (9*n^2+3*n+1) * n!.at n=6A082036
• A square array of quadratic-factorial numbers, read by antidiagonals.at n=51A082038
• Triangle T(n,k) read by rows: number of permutations in S_n avoiding all k-length patterns starting with fixed m, 2<k<=n, 1<=m<=k.at n=33A104001
• Primal codes of canonical finite permutations on positive integers.at n=15A109299
• Minimal Goedel number of endofunctions on k points, by row and sorted within rows (number of points).at n=30A125024
• a(n) = n^5 - n^3 - n^2.at n=12A133070
• Triangle T(n, k) = k! * (k+1)^(n-k), read by rows.at n=41A137268
• Triangle T(n, k) = A090443(n-1)/(A090443(k-1)*A090443(n-k-1)) read by rows.at n=39A173882
• Triangle T(n, k) = A090443(n-1)/(A090443(k-1)*A090443(n-k-1)) read by rows.at n=41A173882
• Number of permutations of 1..n with i-8<=p(i)<=i+6.at n=8A179353
• Number of permutations of 1..n with i-9<=p(i)<=i+6.at n=8A179359
• Number of permutations of 1..n with i-10<=p(i)<=i+6.at n=8A179366
• Triangular array: T(n,k) = sqrt(C(n-1,k-1)*C(n-1,k)*C(n,k+1)* C(n+1,k+1)*C(n+1,k)*C(n,k-1)), where C(n,k) = binomial(n,k).at n=24A197208
• Numbers n such that n = k/d(k) has exactly 4 solutions, where d(k) = number of divisors of k.at n=24A217125
• a(n) = smallest m such that A187824(m) = n, or -1 if A187824 never takes the value n.at n=18A220890