32770

Appears in sequences

• Numbers that are the sum of 4 positive 7th powers.at n=25A003371
• a(0) = 1, a(n) = 32*n^2 + 2 for n > 0.at n=32A010021
• a(n) = (n-1)*(n-2)*(n-3) + n.at n=33A034324
• Numbers having four 0's in base 8.at n=8A043424
• Binary encoding of A006881, numbers with two distinct prime divisors.at n=47A048639
• Number of conjugacy classes in Clifford group CL(n).at n=15A049332
• a(n) = 2^n + 2.at n=15A052548
• Number of elements in the continued fraction for Sum_{k=0..n} 1/2^2^k.at n=16A056469
• Numbers k such that x^k + x^3 + 1 is irreducible over GF(2).at n=42A057461
• Numbers n such that x^n + x^3 + x^2 + x + 1 is irreducible over GF(2).at n=34A057496
• a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is a power of 2".at n=40A079256
• a(n) = n^3 + 2.at n=32A084380
• a(n)=2a(n-1)+a(n-2)-2a(n-3).at n=14A087288
• a(n) = A089709(n+1)/A089709(n).at n=15A089985
• a(n) = A102371(n) + n. Or, 2*A103745.at n=15A105024
• A106486-encodings of combinatorial games with value -1.at n=32A125993
• a(0) = 2, a(n) = 2^n + 2 for n>=1.at n=15A133140
• Binomial transform of [1, 5, -1, 5, -1, 5, ...]. Inverse binomial transform of A134350.at n=14A134351
• a(n) = a(n-1) + 2a(n-2).at n=15A135440
• a(n) = 3*a(n-1) - 3*a(n-2) + 2*a(n-3), with a(0) = a(1) = -1 and a(2) = 3.at n=15A135446