62208

Appears in sequences

• Theta series of E_6 lattice.at n=34A004007
• Highly powerful numbers: numbers with record value of the product of the exponents in prime factorization (A005361).at n=23A005934
• a(n) = Product_{i=0..8} floor((n+i)/9).at n=31A009714
• Denominator of sum of -5th powers of divisors of n.at n=11A017674
• Numbers of form 6^i*8^j, with i, j >= 0.at n=22A025627
• a(n) = Sum_{k=0..floor(n/2)} A026637(n-k, k).at n=23A026647
• Numbers m such that uphi(sigma(m)) = 2m, where the unitary phi function (A047994) is defined by: if x = p1^r1*p2^r2*p3^r3*... then uphi(x) = (p1^r1 - 1)*(p2^r2 - 1)*(p3^r3 - 1)*...at n=12A030165
• Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*12^j.at n=13A038302
• Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*9^j.at n=11A038335
• a(n) = 2^(n-3)*n^2*(n+3).at n=9A058645
• For an integer k with prime factorization p_1*p_2*p_3* ... *p_m let k* = (p_1+1)*(p_2+1)*(p_3+1)* ... *(p_m+1) (A064478); sequence gives k such that k* is divisible by k.at n=19A064476
• For an integer n with prime factorization p_1*p_2*p_3* ... *p_m let n* = (p_1+1)*(p_2+1)*(p_3+1)* ... *(p_m+1); sequence gives n* such that n* is divisible by n, ordered by increasing value of n.at n=11A064518
• Product of nonzero digits of A066551(n).at n=8A066583
• Numbers n such that n=phi(n)*core(n) where phi(x) is the Euler totient function and core(x) the squarefree part of x (the smallest integer such that x*core(x) is a square).at n=26A069185
• 13-almost primes (generalization of semiprimes).at n=13A069274
• 5-full numbers: if a prime p divides k then so does p^5.at n=26A069492
• Smallest number with a prime signature whose indices are the decimal digits of n.at n=58A069877
• Main diagonal of the table of k-almost primes (A078840): a(n) = (n+1)-st integer that is an n-almost prime.at n=13A078841
• a(n) = n! / A003040(n).at n=11A082914
• Number of fault-free tilings of a 4 X 3n rectangle with right trominoes.at n=7A084477