88529281

Appears in sequences

• a(n) = (4n+1)^4.at n=24A016816
• a(n) = (5*n + 2)^4.at n=19A016876
• a(n) = (6*n + 1)^4.at n=16A016924
• a(n) = (7*n + 6)^4.at n=13A017056
• a(n) = (8*n + 1)^4.at n=12A017080
• a(n) = (9*n + 7)^4.at n=10A017248
• a(n) = (10*n+7)^4.at n=9A017356
• a(n) = (11*n + 9)^4.at n=8A017500
• a(n) = (12*n + 1)^4.at n=8A017536
• a(n) = prime(n)^4.at n=24A030514
• Fourth power of primes of the form 4k+1 (A002144).at n=10A080175
• a(n) = the largest n-digit number with exactly 5 divisors, a(n) = 0 if no such number exists.at n=7A182647
• Number of 6 X n 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 1 and 0 1 1 vertically.at n=9A208121
• a(n) = prime(n)^(prime(n + 1) - prime(n)).at n=24A218460
• Fourth powers that become prime when their most significant (leftmost) decimal digit is removed.at n=8A226092
• Number of (n+1) X (7+1) arrays of permutations of 0..n*8+7 with each element having index change +-(.,.) 0,0 0,1 or 2,-2.at n=2A264089
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change +-(.,.) 0,0 0,1 or 2,-2.at n=38A264090
• Number of (3+1)X(n+1) arrays of permutations of 0..n*4+3 with each element having index change +-(.,.) 0,0 0,1 or 2,-2.at n=6A264092
• a(n) = (2^n + 3^n)^n for n>= 0.at n=4A326555
• a(n) = largest 4-brilliant number (A376704) with n decimal digits.at n=6A376706