838860

Appears in sequences

• Every run length in base 2 is 2.at n=9A043291
• a(n) = floor(8^8/n).at n=19A057070
• Expansion of 1/((1-x)*(1-2*x)*(1+x^2)).at n=19A077854
• a(n) = A080315(n) - 2^A000523(A080315(n)), i.e., the terms of A080315 without their most significant bit.at n=23A080316
• A014486-encoding of the Catalan mountain ranges with only even-length slopes allowed.at n=23A083932
• a(n) = 4 * floor(24*2^n/15) = 4*A077854(n).at n=17A102652
• a(n) is the number whose binary representation is the concatenation of n strings of the four digits "1100".at n=5A108020
• Number of closed walks of length n on the complete graph on 5 nodes from a given node.at n=11A109499
• G.f.: (4*x^2 + 2*x)/(4*x^3 - x^2 - 4*x + 1).at n=10A115243
• Row sums of triangle A118404.at n=22A118405
• a(n) = 3*a(n-1) + 4*a(n-2) - a(n-3) + 3*a(n-4) + 4*a(n-5).at n=10A135345
• G.f. satisfies A(x) = 1 + x*(1 + x*A(x)^4)^3.at n=9A137957
• a(n) = floor(A140657(n+2)/10).at n=21A140659
• a(n) = a(n-2) + 4*a(n-3) - 4*a(n-5), where a(0) = 1, a(1) = 4, a(2) = 7, a(3) = 12, a(4) = 19, a(5) = 28.at n=27A297554
• a(n) = a(n-1) + 16*a(n-3) - 16*a(n-4), where a(0) = 1, a(1) = 4, a(2) = 8, a(3) = 12, a(4) = 76.at n=15A297555
• Records in A175046.at n=29A319422