174760

Appears in sequences

• Number of degree-n irreducible polynomials over GF(2) with trace = 0 and subtrace = 1.at n=23A042979
• Number of degree-n irreducible polynomials over GF(2) with trace = 1 and subtrace = 0.at n=23A042981
• Number of degree-n irreducible polynomials over GF(2) with trace = 1 and subtrace = 1.at n=23A042982
• Numbers k such that usigma(phi(k)) is a prime.at n=32A065875
• Number of binary Lyndon words of length n with trace 0 and subtrace 0 over Z_2.at n=23A074027
• Number of binary Lyndon words of length n with trace 1 and subtrace 0 over Z_2.at n=23A074029
• Number of binary Lyndon words of length n with trace 1 and subtrace 1 over Z_2.at n=23A074030
• Numbers k such that phi(k) is a perfect 8th power.at n=21A078168
• a(n) = abs(A154879(n+1)).at n=18A115341
• a(n) = sum of squares of first n odd primes.at n=31A133547
• a(n) = (2^n + 2*(-1)^n - 6)/3.at n=19A153772
• Third differences of the Jacobsthal sequence A001045.at n=19A154879
• Triangle of the elementwise product of binomial coefficients with q-binomial coefficients [n,k] for q = 4.at n=37A157641
• Triangle of the elementwise product of binomial coefficients with q-binomial coefficients [n,k] for q = 4.at n=43A157641
• Terms of A181666 of the form 3*k+1.at n=32A172126
• Triangle read by rows: T(n,k) = number of squares and rectangles of area 2^(k-1) after 2^n stages in the toothpick structure of A139250, n>=1, k>=1, assuming the toothpicks have length 2.at n=45A211016
• Numbers n such that sigma(n) - 1 and sigma(phi(n)) are both primes.at n=25A270416
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 793", based on the 5-celled von Neumann neighborhood.at n=17A284086
• Numbers h such that 2^phi(h) == phi(h) (mod h).at n=32A292544
• Number of monic irreducible polynomials of degree n over GF(16) that have a given nonzero trace.at n=5A300675