23133

Appears in sequences

• a(n) = T(2n-1,n-1), T given by A026758. Also T(2n+1,n+1), T given by A026747.at n=7A026762
• a(n) = T(n, floor(n/2)), T given by A026758.at n=15A026764
• Greatest number in row n of array T given by A026758.at n=15A027230
• Number of 4-ary Lyndon words whose trace and subtrace are both 0 mod 4.at n=10A068596
• Number of 4-ary Lyndon words of length n over Z_4 with trace 1 and subtrace 3.at n=10A074409
• Number of 4-ary Lyndon words of length n over Z_4 with trace 2 and subtrace 0.at n=10A074410
• T(n,k)=number of increasing sequences of n integers x(1),...,x(n) with values in 1..k*n such that x(j) divides x(k) if j divides k.at n=61A180383
• Number of increasing sequences of n integers x(1),...,x(n) with values in 1..5*n such that x(j) divides x(k) if j divides k.at n=6A180387
• Number T(n,k) of parts in all proper k-times partitions of n; triangle T(n,k), n >= 1, 0 <= k <= n-1, read by rows.at n=33A327631