130691232

Appears in sequences

• Powers of 42.at n=5A009986
• a(n) = (2*n)^5.at n=21A016745
• a(n) = (3*n)^5.at n=14A016769
• a(n) = (4n+2)^5.at n=10A016829
• a(n) = (5*n + 2)^5.at n=8A016877
• a(n) = (6*n)^5.at n=7A016913
• a(n) = (7n)^5.at n=6A016985
• a(n) = (8*n + 2)^5.at n=5A017093
• a(n) = (9*n + 6)^5.at n=4A017237
• a(n) = (10*n + 2)^5.at n=4A017297
• a(n) = (11*n + 9)^5.at n=3A017501
• a(n) = (12*n + 6)^5.at n=3A017597
• Smallest fifth power that begins with n.at n=13A018871
• Fifth powers ending nontrivially in a nonzero fifth power.at n=7A038681
• Totally multiplicative sequence with a(p) = 42.at n=31A165863
• a(n) = sqrt(A167657(n)).at n=42A167761
• a(n) = n^p*(n) where p*(n) is the multiplicative partition function.at n=41A218323
• a(n) = (n*(n+1))^5.at n=6A248720
• a(n) = Product_{d|n} (pod(d)/d) where pod(k) is the product of the divisors of k (A007955).at n=41A322672
• Table T(n,k) read by upward antidiagonals. T(n,k) is the maximum value of Product_{i=1..n} Sum_{j=1..k} r[(i-1)*k+j] among all permutations r of {1..kn}.at n=31A333420