69273666

Appears in sequences

• Number of primitive polynomials of degree n over GF(2) (version 2).at n=30A000020
• a(n) = floor(2^n / n).at n=30A000799
• 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=31A001037
• Number of primitive polynomials of degree n over GF(2).at n=30A011260
• Product_{k>=1}1/(1 - x^k)^a(k) = 1 + 2x.at n=30A038063
• Product_{k>=1} (1 + x^k)^a(k) = 1 + 2x.at n=30A038067
• A simple grammar: cycles of pairs of sequences.at n=31A052823
• a(n) = phi(2^prime(n) - 1)/prime(n); a(0) = 0 by convention.at n=11A056743
• a(n) = (1/n) * Sum_{ d divides n } mu(n/d) * (2^d - 1).at n=30A059966
• Number of orbits of length n in map whose periodic points are A000051.at n=30A060477
• Number of orbits of length n in map whose periodic points come from A059990.at n=30A060480
• Number of subsets of {1,2,..n} that sum to 1 mod n.at n=30A064355
• a(n) = (2^prime(n)-2)/prime(n); a(0) = 0 by convention.at n=11A064535
• a(n) = round( 2^n/n ).at n=30A065482
• a(n) = floor of (2^n-1)/n.at n=30A082482
• a(n) = A086323(n)/n.at n=30A086442
• Number of n-bead necklaces using exactly three colors with no adjacent beads having the same color.at n=30A093367
• a(n) = Sum_{k=0..n} floor(binomial(n,k)/(k+1)).at n=29A095718
• a(n) = (A097406(n) - 1)/n.at n=30A097407
• a(n) = A056188(n)/n.at n=30A098792