48567

Appears in sequences

• a(n) = Sum{T(i,j)}, 0<=j<=i, 0<=i<=n, T given by A026907.at n=9A026917
• Expansion of g.f. 1/(1-(x+x^2+x^3+x^4+x^6+x^7)).at n=17A189101
• Number of nX5 0..1 arrays with every element unequal to 0, 1, 2, 4, 5 or 6 king-move adjacent elements, with upper left element zero.at n=5A305639
• Number of nX6 0..1 arrays with every element unequal to 0, 1, 2, 4, 5 or 6 king-move adjacent elements, with upper left element zero.at n=4A305640
• T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 4, 5 or 6 king-move adjacent elements, with upper left element zero.at n=49A305642
• T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 4, 5 or 6 king-move adjacent elements, with upper left element zero.at n=50A305642
• Number of sets of nonempty words with a total of n letters over ternary alphabet such that within each word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.at n=10A340410