252645135

Appears in sequences

• Number of n-bead necklaces with beads of 2 colors and primitive period n, when turning over is not allowed but the two colors can be interchanged.at n=34A000048
• Sierpiński's triangle (Pascal's triangle mod 2) converted to decimal.at n=27A001317
• Divisors of 2^32 - 1 (for a(1) to a(31), the 31 regular polygons with an odd number of sides constructible with ruler and compass).at n=27A004729
• a(n) = floor(2^(n-1)/n).at n=33A006788
• Bisection of A001317.at n=13A038192
• Odd values of n for which a regular n-gon can be constructed by compass and straightedge.at n=26A045544
• Smallest number whose Euler totient is divisible by 2^n.at n=27A053576
• Number of binary vectors (x_1,...x_n) satisfying Sum_{i=1..n} i*x_i = 3 (mod n+1) = size of Varshamov-Tenengolts code VT_3(n).at n=33A054200
• Nearest integer to 2^(n-1)/n.at n=33A054650
• Number of monic irreducible polynomials over GF(4) of degree n with fixed nonzero trace.at n=16A054660
• Number of monic irreducible polynomials over GF(4) with zero trace.at n=16A054661
• Number of 4-ary Lyndon words of length n with trace 0 mod 4.at n=16A054664
• Number of primitive (period n) n-bead necklace structures using exactly two different colored beads.at n=33A056303
• List of codewords in binary lexicode with Hamming distance 16 written as decimal numbers.at n=4A075964
• Basis for code in A075964.at n=2A075965
• Positions of check bits in code in A075967.at n=2A075969
• Numbers such that every run length in base 2 is 4.at n=6A154806
• Trisection of A001317.at n=9A177882
• Fermat quotients for base 4: (4^(p - 1) - 1)/p, where p = prime(n).at n=5A180511
• a(n+1) = 2*a(n) + A014017(n+5), a(0) = 0.at n=32A191497