559872

Appears in sequences

• Numbers that are the sum of 2 positive 7th powers.at n=20A003369
• Numbers that are the sum of at most 2 positive 7th powers.at n=27A004864
• Denominator of sum of -4th powers of divisors of n.at n=35A017672
• Ratios of successive terms are 2, 3, 2, 3, 2, 3, 2, 3, ...at n=15A026549
• Triangle whose (i,j)-th entry is binomial(i,j)*6^(i-j)*12^j.at n=22A038266
• Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*6^j.at n=26A038332
• Sums of two powers of 6.at n=35A055257
• Another erroneous version of A009287.at n=5A061080
• 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=26A064476
• 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=14A064518
• Ninth column of triangle A067425.at n=4A067429
• 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=36A069185
• 6-full numbers: if p divides n then so does p^6.at n=33A069493
• For n>3, a(n) = smallest number divisible by exactly n-2 previous terms; a(n)=n for n<=3.at n=30A084391
• Number of divisors of n! that are coprime to n.at n=37A095997
• Triangle read by rows: T(n,k) = 2^n * 3^k, 0 <= k <= n, n >= 0.at n=43A100851
• a(n) is the product of first n terms of sequence A127644.at n=5A127646
• a(n) = phi(6^n).at n=8A167747
• Numbers k that have measure of smoothness J larger than 7, where J = log(k)/log(rad(k)) and rad(k) is the product of the distinct prime divisors of k (A007947).at n=28A172422
• Expansion of 36*x^2*(1+36*x^2-6*x) / ((36*x^2+6*x+1)*(1-6*x)^2).at n=6A181635