80621568

Appears in sequences

• 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=25A064518
• Number of fault-free tilings of a 4 X 3n rectangle with right trominoes.at n=11A084477
• Smallest number beginning with 8 and having exactly n prime divisors counted with multiplicity.at n=20A106428
• Cubes for which both the sum of the digits and the product of the digits are squares.at n=23A117690
• Cubes c(n) such that cube(n)-square(n)-1 and cube(n)+square(n)+1 are primes.at n=16A155930
• A coding sequence of binary based integers using powers of {2,3} for {0,1}.at n=10A176904
• a(n) is the product of divisors d of n such that d is not equal to m^k where m = noncomposite number, k >= 1.at n=71A183092
• (n-1)-st elementary symmetric function of the first n terms of (3,1,2,3,1,2,3,1,2,...).at n=25A203161
• Expansion of g.f. (1+2*x)/(1-6*x).at n=10A270576
• Denominator of discriminant of n-th Bernoulli polynomial.at n=6A285740
• Records in A319100.at n=36A307252
• Read terms e = T(n,k) in A333624 as Product(prime(k)^e) for n in A334556.at n=36A333625
• Numbers that are the sum of three third powers in nine or more ways.at n=19A345119
• Numbers that are the sum of three third powers in exactly nine ways.at n=14A345120
• Number of ways to tile a double-hexagon strip of n hexagons, using single and double hexagons.at n=31A354541
• 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); sequence gives k* such that k* is divisible by k.at n=25A380574
• Powers k^m, m > 1, where k is an Achilles number whose squarefree kernel is a primorial.at n=24A389226
• Powers k^m, m > 1, where k is an Achilles number that is a product of primorials.at n=15A389260
• Powers k^m, m > 2, where k is an Achilles number.at n=6A390436