95325

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=22A000048
• a(n) = floor(2^(n-1)/n).at n=21A006788
• Number of products of distinct primes <= prime(n) equal to -1 (mod prime(n)).at n=23A024404
• Thickened pyramidal numbers: a(n) = 2*(n+1)*n + Sum_{i=1..n} (4*i*(i-1) + 1).at n=41A050533
• 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=21A054200
• Nearest integer to 2^(n-1)/n.at n=21A054650
• Number of monic irreducible polynomials over GF(4) of degree n with fixed nonzero trace.at n=10A054660
• Number of monic irreducible polynomials over GF(4) with zero trace.at n=10A054661
• Number of 4-ary Lyndon words of length n with trace 0 mod 4.at n=10A054664
• Indices of primes in sequence defined by A(0) = 77, A(n) = 10*A(n-1) - 3 for n > 0. Numbers n such that (690*10^n + 3)/9 is prime.at n=12A056260
• Number of primitive (period n) n-bead necklace structures using exactly two different colored beads.at n=21A056303
• Duplicate of A054661.at n=10A074024
• Fermat quotients for base 4: (4^(p - 1) - 1)/p, where p = prime(n).at n=3A180511
• Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+287)^2 = y^2.at n=33A205644
• Number of nonzero elements in GF(2^n) that are 11th powers.at n=19A213247
• Smallest m > 0 such that the triangular number m*(m+1)/2 is divisible by 2^n-1.at n=19A343995