23901

Appears in sequences

• Number of degree-n irreducible polynomials over GF(4) with trace 0 and subtrace 0.at n=10A074031
• Number of degree-n irreducible polynomials over GF(4) with trace 1 and subtrace 1.at n=10A074034
• Number of 4-ary Lyndon words of length n over GF(4) with trace 0 and subtrace 0.at n=10A074446
• Number of 4-ary Lyndon words of length n over GF(4) with trace 1 and subtrace 1.at n=10A074449
• Number of nonempty subsets of {1,2,...,n} with no gap of length greater than 4 (a set S has a gap of length d if a and b are in S but no x with a < x < b is in S, where b-a=d).at n=14A119407
• a(1)=1. For n >= 2, each a(n) = the decimal equivalent of either a(k)U0Ua(k) or a(k)U1Ua(k), where U denotes concatenation of the binary representations of the arguments, and where k is some positive integer < n. The numbers are arranged in numerical order.at n=9A165784
• Base 10 representation of A240602.at n=35A165785
• a(n) = smallest number k such that three consecutive prime numbers prime(n), prime(n+1) and prime(n+2) are divisors of k, k+1 and k+2 respectively.at n=10A180095
• Walsh matrix antidiagonals converted to decimal.at n=14A197818
• Shifts 5 places left under Euler transform with a(0)=0 and a(n)=1 for n<5.at n=28A218022