39291

Appears in sequences

• a(n) = Fibonacci(n)^3 + (-1)^n*Fibonacci(n-2).at n=7A220361
• Least number k not divisible by 10 such that the decimal expansion of k^n contains some digit exactly n times.at n=36A243151
• Least number x such that x^n has n digits equal to k. Case k = 6.at n=36A285453
• Left-truncatable happy numbers: every suffix is a happy number and no digits are zero.at n=25A383639