7077888

Appears in sequences

• a(n) = (6*n)^3.at n=32A016911
• a(n) = (8*n)^3.at n=24A017067
• a(n) = (9*n + 3)^3.at n=21A017199
• a(n) = (10*n + 2)^3.at n=19A017295
• a(n) = (11*n + 5)^3.at n=17A017451
• a(n) = (12*n)^3.at n=16A017523
• Cubes such that digits of cube root of n are not present in n.at n=20A029786
• Cubes k such that digits of cube root of k are not present in k^(2/3) or k.at n=12A029792
• Cubes with at most three distinct digits.at n=25A030295
• First differences of A045891.at n=22A034007
• a(n) = (3^3)*4^(n-3) with a(0)=1, a(1)=1 and a(2)=7.at n=12A056120
• Expansion of (1+3*x+4*x^2)/(1-4*x^2+4*x^4).at n=35A058582
• Numbers n such that sum of digits of n is equal to the sum of the prime factors of n, counted with multiplicity.at n=20A063737
• a(n) = (1/4) * (number of n X n 0..11 matrices with MM' mod 12 = I).at n=3A071310
• Smith cubic numbers.at n=4A098838
• Smallest Smith number with n prime factors.at n=19A104168
• Highly decomposable Smith numbers. A Smith number which sets a record for the number of prime factors (counting multiplicity) starting from first Smith number is called a highly decomposable Smith number.at n=13A104169
• Smallest number beginning with 7 and having exactly n prime divisors counted with multiplicity.at n=20A106427
• Second differences of A045623, prefixed by an initial 1.at n=21A109975
• a(n) = Tau(N), where N = the number obtained as a concatenation of 9801 with itself n times. Tau(n) = number of divisors of n.at n=20A110755