967680

Appears in sequences

• Number of invertible 2 X 2 matrices mod n.at n=34A000252
• Denominators of coefficients for numerical integration.at n=2A002198
• Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j)*12^j (with i, j >= 0).at n=31A038218
• Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*2^j.at n=32A038328
• Value of phi in arithmetic progression of at least 5 terms having the same value of phi in A050515.at n=28A050517
• Expansion of e..g.f.: (1-x)/(1-x-x^2-x^3+x^4).at n=8A052588
• a(n) = 3*n*n!.at n=8A052673
• Expansion of e.g.f. 3*x/(1 - 2*x).at n=7A052676
• a(n) = 2^(n-1) * n! * Catalan(n-1) for n > 0 with a(0) = 0.at n=6A052714
• Products of distinct factorials.at n=35A058295
• Sum of non-unitary divisors of central binomial coefficient C(n, floor(n/2)).at n=21A064141
• Number of endofunctions on n labeled points constructed from k rooted trees.at n=33A066324
• Product of factorials of the digits of n.at n=48A066459
• a(n) = a(n-1)*a(n-2)*a(n-3)*(1+1/(n-3)), a(1)=a(2)=a(3)=1.at n=8A072043
• Numbers n such that n! is a product of distinct factorials k!*l!*m!*... with k, l, m, etc. < n.at n=36A075082
• Smallest k such that d(phi(k)) - phi(d(k)) = -n, where d(k) = A000005(k) and phi(k) = A000010(k).at n=23A078151
• a(1) = 1, a(2) = 2; for n>2, a(n) = 3*(n-2)*(n-2)!.at n=9A083746
• Table (by antidiagonals) of permutations of two types of objects such that each cycle contains at least one object of each type. Each type of object is labeled from its own label set.at n=41A091441
• Table (by antidiagonals) of permutations of two types of objects such that each cycle contains at least one object of each type. Each type of object is labeled from its own label set.at n=39A091441
• Highly totient numbers: each number k on this list has more solutions to the equation phi(x) = k than any preceding k (where phi is Euler's totient function, A000010).at n=39A097942