69632

Appears in sequences

• a(n) = 4^n + n^4.at n=8A001589
• a(1) = 1, a(2n) = 16a(n), a(2n+1) = a(2n)+1.at n=24A033052
• Sums of 2 distinct powers of 4.at n=34A038470
• Number of 1's in all compositions of n+1.at n=14A045623
• Sums of two powers of 4.at n=42A055236
• Sums of two powers of 16.at n=13A055261
• Expansion of (1+3*x+4*x^2)/(1-4*x^2+4*x^4).at n=22A058582
• a(n) = n^4*Product_{distinct primes p dividing n} (1+1/p^4).at n=15A065960
• S(n; 1,0) = S(n; 3,0) where S(n; t,s) is the number of length n 4-ary strings whose digits sum to t mod 4 and whose sum of products of all pairs of digits sum to s mod 4.at n=9A068786
• Number of strings over Z_4 of length n with trace 1 and subtrace 2.at n=9A068787
• 13-almost primes (generalization of semiprimes).at n=17A069274
• Erroneous duplicate of A068787.at n=9A073959
• 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=30A076980
• a(n) = -2*a(n-1) + 4*a(n-2), a(0)=1, a(1)=2.at n=11A087205
• Number of subsets of {1,.., n} containing at least one twin prime pair.at n=16A089828
• Triangle read by rows: T(n,r) = n^r + r^n (1 <= r <= n).at n=31A093898
• a(n) = 2^n+n^3.at n=16A097339
• Conjectured greatest k such that S(k) = S(k-n), or 0 if no k is known, where S is the Kempner function A002034.at n=16A099119
• a(n) = 2^(n - 2)*(binomial(n,2) + 2).at n=11A104270
• a(n) = 17*2^n.at n=12A110287