131081
domain: N
Appears in sequences
- First primitive GF(2)[X] polynomial of degree n.at n=16A132447
- First primitive GF(2)[X] polynomial of degree n with at most 5 terms.at n=16A132449
- First primitive GF(2)[X] polynomial of degree n and minimal number of terms.at n=16A132453
- a(n) = 2^n + ceiling(n/2).at n=17A134522
- Positive integers with the same number of 1s in base 10 and base 2.at n=16A153115
- a(n) = 9 + n^17.at n=2A165254
- Sums of three Mersenne primes.at n=36A174055
- a(n) = 2^n + 9.at n=17A188165
- a(n) = 2^(2*n - 1) + n.at n=8A221130
- Number of ways to choose a constant partition of each part of a constant partition of n.at n=34A279789
- Lexicographically first irreducible polynomial over GF(2) of degree n, evaluated at X = 2.at n=16A344141
- Lexicographically first irreducible polynomial over GF(2) of degree n with the lowest possible number of terms, evaluated at X = 2.at n=16A344142
- Smallest number with exactly n 1's in its digits both in decimal and binary representation.at n=2A350691
- Bitmaps of king + rook vs. king checkmate patterns on a standard 8 X 8 board.at n=9A362950
- Numbers k such that A380459(A019565(k)) has no divisors of the form p^p, for any prime p.at n=29A392604