26091

Appears in sequences

• Number of ternary words of length n that are not "bifix-free".at n=10A094538
• a(n) = A094538(n)/3.at n=11A094539
• Number of (n+1) X (1+1) 0..2 arrays with the difference between each 2 X 2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise.at n=3A235432
• Number of (n+1)X(4+1) 0..2 arrays with the difference between each 2X2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise.at n=0A235435
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the difference between each 2X2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise.at n=6A235437
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the difference between each 2X2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise.at n=9A235437
• Number of (n+1)X(4+1) 0..2 arrays with the difference between each 2X2 subblock maximum and minimum lexicographically nondecreasing columnwise and nonincreasing rowwise.at n=0A236488
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the difference between each 2X2 subblock maximum and minimum lexicographically nondecreasing columnwise and nonincreasing rowwise.at n=6A236490
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the difference between each 2X2 subblock maximum and minimum lexicographically nondecreasing columnwise and nonincreasing rowwise.at n=9A236490
• Number of (4+1)X(n+1) 0..2 arrays with the difference between each 2X2 subblock maximum and minimum lexicographically nondecreasing columnwise and nonincreasing rowwise.at n=0A236493
• Number of compositions of n into square parts k^2 where there are k sorts of part k^2.at n=24A240944
• Expansion of Product_{k>=1} 1/(1 - (4*k-1)*x^(4*k-1)).at n=27A265828
• Numbers n such that there are precisely 11 groups of orders n and n + 1.at n=1A295994
• Two-Catalan Triangle read by rows, for n>=0 and k>=0.at n=56A380912