3359232

Appears in sequences

• Numbers that are the sum of 2 nonzero 8th powers.at n=20A003380
• Numbers that are the sum of at most 2 nonzero 8th powers.at n=27A004875
• Numbers of form 8^i*9^j, with i, j >= 0.at n=32A025633
• Ratios of successive terms are 2, 3, 2, 3, 2, 3, 2, 3, ...at n=17A026549
• Coefficient triangle for certain polynomials.at n=31A055864
• Fourth column of triangle A055864.at n=7A055867
• a(n) = n^3 * 3^n.at n=8A062074
• 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=33A064476
• Product of gcd(k,n) for 1 <= k <= n.at n=17A067911
• Numbers n such that A017666(n)=phi(n).at n=23A069058
• Number of minimal monic annihilator polynomials over the ring of integers modulo n.at n=64A069098
• Greatest common divisor of product of divisors of n and product of non-divisors < n.at n=35A072046
• For n>3, a(n) = smallest number divisible by exactly n-2 previous terms; a(n)=n for n<=3.at n=34A084391
• A sequence generated from a semi-magic square.at n=8A094943
• Triangle read by rows: T(n,k) = 2^n * 3^k, 0 <= k <= n, n >= 0.at n=53A100851
• Table read by antidiagonals: T(n,k) = count of increasing runs in strings of length n*k formed by concatenating k permutations of [n].at n=38A112858
• Numbers of the form j^k * k^j, where j,k > 1.at n=20A146748
• a(n) = phi(6^n).at n=9A167747
• a(n) = 8^n*n^8.at n=3A198404
• a(n) = n^4*(n+1)^4/8.at n=7A202107