18785

Appears in sequences

• a(n) = 4^n + n^4.at n=7A001589
• a(n) = 7^n + n^7.at n=4A001596
• a(n) = |1^3 - 2^3 + 3^3 - 4^3 + ... + (-1)^(n+1)*n^3|.at n=33A011934
• a(0)=1, a(1)=4, a(n) = Sum_{k=0..n-1} 4^k*a(k).at n=4A015489
• Numbers that are the sum of 2 nonzero squares in exactly 6 ways.at n=10A025289
• Numbers that are the sum of 2 nonzero squares in 5 or more ways.at n=16A025296
• Numbers that are the sum of 2 nonzero squares in 6 or more ways.at n=10A025297
• Numbers that are the sum of 2 distinct nonzero squares in exactly 6 ways.at n=10A025307
• Numbers that are the sum of 2 distinct nonzero squares in 5 or more ways.at n=14A025315
• Numbers that are the sum of 2 distinct nonzero squares in 6 or more ways.at n=10A025316
• a(n) = (2*n+1)*(9*n+1).at n=32A033573
• Stirling interpolation of f'(x) by (2n+1)-st differences.at n=16A061027
• Leyland numbers: 3, together with numbers expressible as n^k + k^n nontrivially, i.e., n,k > 1 (to avoid n = (n-1)^1 + 1^(n-1)).at n=24A076980
• Maximal values of m=a^2+b^2=c^2+d^2 for each x=a+b+c+d=6*p (p=any odd prime).at n=14A093300
• Triangle read by rows: T(n,r) = n^r + r^n (1 <= r <= n).at n=24A093898
• Numbers m that are the hypotenuse of exactly 22 distinct integer-sided right triangles, i.e., m^2 can be written as a sum of two squares in 22 ways.at n=11A097103
• Numbers of the form p^4 + 4^p for p prime.at n=3A097199
• a(n) = p^n + n^p where p = prime(n).at n=3A098138
• Number of divisors of 240^n.at n=16A103532
• n+phi(n)+phi(phi(n)) is a cube.at n=16A116042