3435973836
domain: N
Appears in sequences
- Every run length in base 2 is 2.at n=15A043291
- Number of degree-n irreducible polynomials over GF(4) with trace 0 and subtrace 1.at n=19A074032
- Number of degree-n irreducible polynomials over GF(4) with trace 1 and subtrace 0.at n=19A074033
- Number of degree-n irreducible polynomials over GF(4) with trace 1 and subtrace 1.at n=19A074034
- Let a = RootOf( x^2+x+1 ) and b = 1+a. Number of degree-n irreducible polynomials over GF(4) with trace 1 and subtrace a.at n=19A074035
- Number of 4-ary Lyndon words of length n over Z_4 with trace 1 and subtrace 0.at n=19A074406
- Number of 4-ary Lyndon words of length n over Z_4 with trace 1 and subtrace 1.at n=19A074407
- Number of 4-ary Lyndon words of length n over Z_4 with trace 1 and subtrace 2.at n=19A074408
- Number of 4-ary Lyndon words of length n over Z_4 with trace 1 and subtrace 3.at n=19A074409
- Number of 4-ary Lyndon words of length n over GF(4) with trace 1 and subtrace 0.at n=19A074448
- Number of 4-ary Lyndon words of length n over GF(4) with trace 1 and subtrace 1.at n=19A074449
- Let x = RootOf(z^2 + z + 1) and y = 1+x. Number of 4-ary Lyndon words of length n over GF(4) with trace 1 and subtrace x.at n=19A074450
- Expansion of 1/((1-x)*(1-2*x)*(1+x^2)).at n=31A077854
- a(n) = 4 * floor(24*2^n/15) = 4*A077854(n).at n=29A102652
- a(n) is the number whose binary representation is the concatenation of n strings of the four digits "1100".at n=8A108020
- Number of closed walks of length n on the complete graph on 5 nodes from a given node.at n=17A109499
- G.f.: (4*x^2 + 2*x)/(4*x^3 - x^2 - 4*x + 1).at n=16A115243
- Row sums of triangle A118404.at n=34A118405
- a(n) = 3*a(n-1) + 4*a(n-2) - a(n-3) + 3*a(n-4) + 4*a(n-5).at n=16A135345
- a(n) = floor(A140657(n+2)/10).at n=33A140659