74329

Appears in sequences

• From George Gilbert's marks problem: jumping 4 marks at a time (final positions).at n=10A019596
• Number of nX4 0..1 arrays with every element equal to 0, 1, 2, 3, 4 or 7 king-move adjacent elements, with upper left element zero.at n=4A299077
• Number of nX5 0..1 arrays with every element equal to 0, 1, 2, 3, 4 or 7 king-move adjacent elements, with upper left element zero.at n=3A299078
• T(n,k) = Number of n X k 0..1 arrays with every element equal to 0, 1, 2, 3, 4 or 7 king-move adjacent elements, with upper left element zero.at n=31A299081
• T(n,k) = Number of n X k 0..1 arrays with every element equal to 0, 1, 2, 3, 4 or 7 king-move adjacent elements, with upper left element zero.at n=32A299081
• Number of nX5 0..1 arrays with every element equal to 0, 1, 2, 3, 4, 7 or 8 king-move adjacent elements, with upper left element zero.at n=3A299841
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 4, 7 or 8 king-move adjacent elements, with upper left element zero.at n=31A299844
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 4, 7 or 8 king-move adjacent elements, with upper left element zero.at n=32A299844
• Number of different periodic multisets that fit within some normal multiset of weight n.at n=19A304648
• Number of partitions of n such that 5*(greatest part) >= (number of parts).at n=43A347869