2985983

Appears in sequences

• a(n) = 12^n - 1.at n=6A024140
• 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=1A050790
• Least m which can be written as i*j+i+j in n different ways: A072670(m)=n.at n=45A072671
• a(n) = n^6 - 1.at n=11A123866
• Numbers n such that the number of divisors of n+1 divides n and the number of divisors of n divides n+1.at n=25A272353
• Sum of two (possibly negative) coprime cubes in at least 3 ways, but not the sum of 2 noncoprime cubes.at n=10A293651
• Odd numbers that are one less than the square of a perfect power.at n=26A389956