20151121

Appears in sequences

• Sum of 4th powers of primes = 1 mod 3 dividing n.at n=66A005073
• Sum of 4th powers of primes = 3 mod 4 dividing n.at n=66A005085
• a(n) = (3*n+1)^4.at n=22A016780
• a(n) = (4*n+3)^4.at n=16A016840
• a(n) = (5*n + 2)^4.at n=13A016876
• a(n) = (6*n + 1)^4.at n=11A016924
• a(n) = (7*n + 4)^4.at n=9A017032
• a(n) = (8*n+3)^4.at n=8A017104
• a(n) = (9*n + 4)^4.at n=7A017212
• a(n) = (10*n+7)^4.at n=6A017356
• a(n) = (11*n + 1)^4.at n=6A017404
• a(n) = (12*n + 7)^4.at n=5A017608
• a(n) = prime(n)^4.at n=18A030514
• Smaller of two successive 4th powers whose sum is a prime.at n=25A075578
• Fourth powers m^4 none of whose digits are present in their corresponding roots m.at n=16A113316
• Numbers k such that k is the fourth power of an integer and the sum of digits of k is prime.at n=23A135554
• A polynomial coefficient sequence:p(x,n,m)=(1 + Eulerian[n+1, m]*x)^n.at n=12A176161
• Numbers of the form p^q^r, for p,q,r primes.at n=25A217709
• a(n) = A001609(n)^2, where g.f. of A001609 is x*(1+3*x^2)/(1-x-x^3).at n=21A218439
• a(n) = prime(n)^(prime(n + 1) - prime(n)).at n=18A218460