39568
domain: N
Appears in sequences
- Exponentiation of g.f. for Fibonacci numbers.at n=9A006701
- Numbers k such that the fractional part of (101/100)^k is greater than 1-(1/k).at n=8A153672
- G.f. satisfies: A(x) = B(x*A(x)), where B(x) is the g.f. of A184506.at n=10A184508
- Numbers n such that n and n^5 have the same set of digits.at n=6A232660
- Least positive k (not a power of 10) such that k and k^n have the same set of digits.at n=4A232712