65538

Appears in sequences

• Numbers that are the sum of 3 nonzero 8th powers.at n=10A003381
• Numbers that are the sum of at most 3 nonzero 8th powers.at n=22A004876
• Numbers that are the sum of at most 4 nonzero 8th powers.at n=37A004877
• a(n) = 1*T(n,0) + 2*T(n,1) + ... + (2n+1)*T(n,2n), T given by A027926.at n=11A027992
• Dirichlet convolution of d(n) (# of divisors) with b_n=2^(n-1).at n=16A034771
• a(n) = 2^n + 2.at n=16A052548
• Number of elements in the continued fraction for Sum_{k=0..n} 1/2^2^k.at n=17A056469
• Numbers k such that x^k + x^3 + 1 is irreducible over GF(2).at n=43A057461
• Sum of divisors of 2^n+1.at n=15A069061
• Maximal element in continued fraction for s(n) = sum( k>=n,1/2^(2^k) ).at n=4A073096
• a(n) = A089709(n+1)/A089709(n).at n=16A089985
• Number of ways of 3-coloring an annulus consisting of n zones joined like a pearl necklace.at n=15A092297
• Number of functions f:[n]->[n] such that f[(x^2) mod n]=[f(x)^2] mod n for all x in [n], for n=1,2,3,... Here [n] denotes {0,1,2,...,n-1}.at n=16A117988
• a(0) = 2, a(n) = 2^n + 2 for n>=1.at n=16A133140
• Binomial transform of [1, 5, -1, 5, -1, 5, ...]. Inverse binomial transform of A134350.at n=15A134351
• Base-3 perfect digital invariants (written in base 10): numbers equal to the sum of the k-th powers of their base-3 digits, for some k.at n=30A162216
• Base 9 perfect digital invariants (written in base 10): numbers equal to the sum of the k-th powers of their base-9 digits, for some k.at n=30A162234
• Semi-sums (means) of a Fermat prime and a Mersenne prime.at n=26A174057
• Sequence defined by a(0)=a(1)=a(2)=1, a(3)=2, a(4)=6 and the formula a(n)=2^(n-2)+2 for n>=5.at n=18A174316
• a(n) = 4^(n-1) + 2: Number of acute angles after n iterations of the Koch snowflake construction.at n=8A178789