134642

Appears in sequences

• A Fielder sequence: a(n) = a(n-1) + a(n-2) + a(n-4).at n=20A001641
• Number of nX5 0..1 arrays with every element equal to 1, 2, 3 or 5 king-move adjacent elements, with upper left element zero.at n=5A297948
• Number of nX6 0..1 arrays with every element equal to 1, 2, 3 or 5 king-move adjacent elements, with upper left element zero.at n=4A297949
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3 or 5 king-move adjacent elements, with upper left element zero.at n=49A297951
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3 or 5 king-move adjacent elements, with upper left element zero.at n=50A297951
• Number of total dominating sets in the wheel graph on n nodes.at n=17A302603