3456000

Appears in sequences

• Multiply successively by 1 (once), 2 (twice), 3 (thrice), etc.at n=13A010552
• Triangle read by rows: T(n,k) = number of rational (+1,-1) matrices of rank k (n >= 1, 1 <= k <= n).at n=12A064231
• a(1) = 3 then a(n) = smallest multiple of a(n-1) > a(n-1) such that a(n) - 1 is a prime.at n=12A084717
• Array used for numerators of g.f.s for column sequences of array A090214 ((4,4)-Stirling2).at n=6A090221
• Numbers such that UnitaryPhi(2*UnitaryPhi(n)) = n.at n=16A117820
• Let k(n) = mod(3,n)-1. Then a(n) = 4*a(n-1) if n is odd, otherwise ((5+k(n))/4)*a(n-1), with a(0) = 1, a(1) = 2.at n=19A123761
• Number of permutations of floor(i*5/3), i=0..n-1, with all sums of 8 adjacent terms unique.at n=9A152697
• Number of permutations of floor(i*7/3), i=0..n-1, with all sums of 8 adjacent terms unique.at n=9A152701
• Number of permutations of floor(i*8/3), i=0..n-1, with all sums of 8 adjacent terms unique.at n=9A152705
• Number of permutations of floor(i*9/5), i=0..n-1, with all sums of 8 adjacent terms unique.at n=9A152710
• Triangle read by rows: T(n,k) is the number of permutations p of {1,2,...,n} for which the number of j < ceiling(n/2) such that p(j) + p(n+1-j) = n+1 is equal to k (n>=1; 0<=k <=ceiling(n/2)).at n=42A155517
• Sorted number of edges of distinct solutions in the mix of 2 or 3 regular convex 4-polytopes.at n=22A199808
• Product of the numbers p such that phi(p) = n, where phi is Euler's totient function.at n=7A217842
• Least number k such that the number of its divisors is n times the number of its prime factors, counted with multiplicity.at n=9A275819
• 3-full numbers (A036966) sandwiched between twin primes.at n=6A360840
• Terms k in A025487 such that k-1 and k+1 are twin primes.at n=39A375197
• Numbers m of the form 2^i * 3^j * 5^k such that i, j, k > 0 and m+1 and m-1 are both prime numbers.at n=23A386252