33312

Appears in sequences

• Numbers whose base-8 representation has exactly 6 runs.at n=21A043628
• Roman numerals written using 1 for I, 2 for V, 3 for X, 4 for L, 5 for C, 6 for D, 7 for M.at n=33A061493
• a(n) = Sum_{k=0..floor(n/4)} C(n-k,3*k)*3^(n-4*k).at n=9A099786
• Total number of parts of multiplicity 3 in all partitions of n.at n=43A117524
• Number of (w,x,y) with all terms in {0,...,n} and w>floor((x+y)/3).at n=36A212974
• Number of binary Lyndon words of length n having a conjugate at Hamming distance 2.at n=31A226893
• a(n) = Sum_{k=1..n} mu(k) * (floor(n/k)^4 - floor((n-1)/k)^4).at n=20A344597
• First position of n in A354578, where A354578(k) is the number of integer compositions whose run-sums constitute the k-th composition in standard order (graded reverse-lexicographic, A066099).at n=34A354905
• Number of edges formed in a square with edge length 1 by straight line segments when connecting the internal edge points that divide the sides into segments with lengths equal to the Farey series of order n to the equivalent points on the opposite side of the square.at n=5A359655
• Lexicographically earliest sequence of distinct integers such that the concatenated binary expansions of the terms is A010051.at n=36A370069
• The binary expansion of a(n) is an initial 1 bit then tracks where the swaps occur in the exchange sort algorithm sorting the binary expansion of n into decreasing order.at n=43A380145