8153726976

Appears in sequences

• a(n) = (4*n)^5.at n=24A016805
• a(n) = (6*n)^5.at n=16A016913
• a(n) = (7*n + 5)^5.at n=13A017045
• a(n) = (8*n)^5.at n=12A017069
• a(n) = (9*n + 6)^5.at n=10A017237
• a(n) = (10*n + 6)^5.at n=9A017345
• a(n) = (11*n + 8)^5.at n=8A017489
• a(n) = (12*n)^5.at n=8A017525
• Let M_n be the n X n matrix m(i,j) = min(prime(i), prime(j)); then a(n) = det(M_n).at n=19A070323
• Partial product of prime gaps: a(n) = a(n-1)*(prime(n+1) - prime(n)).at n=19A081411
• Smallest number beginning with 8 and having exactly n prime divisors counted with multiplicity.at n=29A106428
• 3^n*2^(n^2).at n=5A133460
• List of pairs (a(n),b(n)): a(n) = prime(n) - prime(n-1) + a(n-1); b(n) = (prime(n) - prime(n-1))*b(n-1).at n=43A154279
• a(n) = Product_{k=1..n-4} (n-k-2)!^(k*k!).at n=6A224986
• Least number of the form 11*m-1 with exactly n prime factors, counted with multiplicity.at n=29A225210
• Determinant of the (n+1) X (n+1) matrix with (i,j)-entry equal to (i-2j)^n for all i,j = 0,...,n.at n=4A228252
• Number of length n+5 0..2 arrays with no six consecutive terms having two times the sum of any two elements equal to the sum of the remaining four.at n=24A249227
• a(n) = (n-1)^n*(n-1)!^n.at n=4A351781
• a(n) = Product_{k=2..n} k^ord(n, k) where ord(n, k) = 0 if k does not divide n, otherwise ord(n, k) = e where e is such that k^e divides n but k^(e + 1) does not.at n=47A364813