27594

Appears in sequences

• Number of primitive polynomials of degree n over GF(2) (version 2).at n=18A000020
• a(n) = floor(2^n / n).at n=18A000799
• Number of degree-n irreducible polynomials over GF(2); number of n-bead necklaces with beads of 2 colors when turning over is not allowed and with primitive period n; number of binary Lyndon words of length n.at n=19A001037
• Number of partitions of 3n into n parts from the set {0, 1, ..., 6} (repetitions admissible).at n=29A001977
• Number of primitive polynomials of degree n over GF(2).at n=18A011260
• Product_{k>=1}1/(1 - x^k)^a(k) = 1 + 2x.at n=18A038063
• Product_{k>=1} (1 + x^k)^a(k) = 1 + 2x.at n=18A038067
• Maximum cycle length in differentiation digraph for n-bit binary sequences.at n=53A038553
• A simple grammar: cycles of pairs of sequences.at n=19A052823
• Numbers k such that 9^k == -1 (mod k-1).at n=7A055692
• a(n) = phi(2^prime(n) - 1)/prime(n); a(0) = 0 by convention.at n=8A056743
• a(n) = (1/n) * Sum_{ d divides n } mu(n/d) * (2^d - 1).at n=18A059966
• Number of orbits of length n in map whose periodic points are A000051.at n=18A060477
• Number of orbits of length n in map whose periodic points come from A059990.at n=18A060480
• Number of subsets of {1,2,..n} that sum to 1 mod n.at n=18A064355
• a(n) = (2^prime(n)-2)/prime(n); a(0) = 0 by convention.at n=8A064535
• a(n) = round( 2^n/n ).at n=18A065482
• a(n) = floor of (2^n-1)/n.at n=18A082482
• a(n) = A086323(n)/n.at n=18A086442
• Numbers n which when converted to base 8, reversed and converted back to base 10 yield a number m such that n mod m = 0. Cases which are trivial or result in digit loss are excluded.at n=10A091082