65792

Appears in sequences

• a(n) = 2^n + n^2.at n=16A001580
• Numbers that are the sum of 2 nonzero 8th powers.at n=7A003380
• Numbers that are the sum of at most 2 nonzero 8th powers.at n=12A004875
• Numbers that are the sum of at most 3 nonzero 8th powers.at n=23A004876
• Numbers that are the sum of at most 4 nonzero 8th powers.at n=39A004877
• Number of (n-1)-bead black-white reversible strings; also binary grids; also row sums of Losanitsch's triangle A034851; also number of caterpillar graphs on n+2 vertices.at n=17A005418
• Number of types of Boolean functions of n variables under a certain group.at n=7A028402
• a(1) = 1, a(2n) = 16a(n), a(2n+1) = a(2n)+1.at n=20A033052
• Sums of 2 distinct powers of 4.at n=32A038470
• Sum of every 4th entry of row n in Pascal's triangle, starting at "n choose 1".at n=18A038504
• Number of elements of GF(2^n) with trace 1 and subtrace 1.at n=18A038521
• Number of 2n-bead balanced binary necklaces which are equivalent to their reverse, complement and reversed complement.at n=34A045674
• Expansion of 2*(1-x-x^2)/((1-2*x)*(1-2*x^2)).at n=16A052957
• Sums of two powers of 4.at n=40A055236
• Sums of two powers of 16.at n=12A055261
• a(-1) = 1; for n >= 0, a(n) = 2^n + 4^n = 2^n*(1 + 2^n).at n=9A063376
• Number of strings over Z_4 of length n with trace 0 and subtrace 0.at n=9A068620
• S(n; 0,3) = S(n; 2,1) 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=9A068777
• S(n; 2,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=9A068789
• Numbers k such that core(k) = ceiling(sqrt(k)) where core(k) is the squarefree part of k (the smallest integer such that k*core(k) is a square).at n=15A069187