229345007

Appears in sequences

• Powers of 47.at n=5A009991
• a(n) = (2*n+1)^5.at n=23A016757
• a(n) = (3*n + 2)^5.at n=15A016793
• a(n) = (4n+3)^5.at n=11A016841
• a(n) = (5*n + 2)^5.at n=9A016877
• a(n) = (6*n + 5)^5.at n=7A016973
• a(n) = (7*n + 5)^5.at n=6A017045
• a(n) = (8*n + 7)^5.at n=5A017153
• a(n) = (9*n + 2)^5.at n=5A017189
• a(n) = (10*n + 7)^5.at n=4A017357
• a(n) = (11*n+3)^5.at n=4A017429
• a(n) = (12*n + 11)^5.at n=3A017657
• Smallest fifth power that begins with n.at n=22A018871
• Fifth powers of primes.at n=14A050997
• a(1) = 1; for n > 1, the smallest n-th power with the digit sum also a nontrivial n-th power, i.e., 10^n is not a member.at n=4A069647
• Minimal sequence such that Omega(a(m))<=Omega(a(n)) for m<n, where Omega=A001222 (sum of exponents in prime factorization).at n=46A080613
• Fifth powers of Lucas numbers.at n=8A103325
• Totally multiplicative sequence with a(p) = 47.at n=31A165868
• a(n) = [x^n] Product_{k>=0} (1 + n*x^(2^k)).at n=47A302451
• a(n) is the smallest fifth power m^5 such that the sum of the digits of m^5 is equal to n^5.at n=2A328374