503284375

Appears in sequences

• a(n) = (2*n+1)^5.at n=27A016757
• a(n) = (3*n+1)^5.at n=18A016781
• a(n) = (4n+3)^5.at n=13A016841
• a(n) = (5*n)^5.at n=11A016853
• a(n) = (6*n + 1)^5.at n=9A016925
• a(n) = (7*n + 6)^5.at n=7A017057
• a(n) = (8*n + 7)^5.at n=6A017153
• a(n) = (9n+1)^5.at n=6A017177
• a(n) = (10*n + 5)^5.at n=5A017333
• a(n) = (11*n)^5.at n=5A017393
• a(n) = (12*n + 7)^5.at n=4A017609
• Fifth power of Fibonacci numbers A000045.at n=10A056572
• a(n) = binomial(n+1, 2)^5.at n=9A059860
• a(n)=(P(n)*P(n+2))^5 with P(i)=i-th prime.at n=2A099210
• Perfect powers k with no primes between k and the next smaller perfect power, which is in A116086.at n=9A116455
• 11^1,22^2,33^3,44^4,...at n=4A145516
• Numbers with prime factorization p^5q^5.at n=14A190465
• Number of nX3 array permutations with every element making zero or one right-handed knight moves (out 2, right 1).at n=14A209538
• a(n) = F(2*n)^5 with F=A000045 (Fibonacci numbers).at n=5A215044