387420488

Appears in sequences

• a(n) = 3^n - 1.at n=18A024023
• a(n) = 9^n-1.at n=9A024101
• a(n+1) = smallest number not containing any digits of a(n), working in base 3.at n=36A030439
• Dirichlet convolution of mu(n) with 3^(n-1).at n=18A034741
• Numbers that are repdigits in base 3.at n=36A048328
• a(n) = n^n - 1.at n=8A048861
• Consider the Diophantine equation x^3 + y^3 = z^3 - 1 (x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z. Sequence gives values of x^3 + y^3 = z^3 - 1.at n=5A050790
• a(n) = 0^n + 3^n - 1.at n=18A103453
• a(n) = 3^n - (-1)^n.at n=18A105723
• a(n) = n^6 - 1.at n=26A123866
• a(n) = 2*A132357(n).at n=17A135263
• a(n) = A000244(n) - A010684(n).at n=18A141317
• a(n) is the smallest integer not yet in the sequence with no common base-3 digit with a(n-1).at n=43A158928
• a(n) = n^9 - 1.at n=8A258810
• Numbers m such that beta(m) = tau(m)/2 + 3 where beta(m) is the number of Brazilian representations of m and tau(m) is the number of divisors of m.at n=12A326383
• Non-oblong numbers that are repdigits with length > 2 in more than three bases.at n=13A326705
• Modulo 3 Pisano period of 'n-bonacci' series.at n=21A337212
• Least positive number k such that n^n divides k*(k+1)/2.at n=8A342930
• Smallest integer with a constant congruence speed of (exactly) n in the radix-n numeral system.at n=7A390597