61139

Appears in sequences

• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers >= 2), t = (F(2), F(3), F(4), ...).at n=17A024874
• Number of positive terms in row n of A082268.at n=16A082269
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (0, -1, 1), (0, 1, 1), (1, -1, -1)}.at n=11A148538
• Number of nX4 0..1 arrays with every element unequal to 0, 1, 2, 3, 4 or 6 king-move adjacent elements, with upper left element zero.at n=4A305526
• Number of nX5 0..1 arrays with every element unequal to 0, 1, 2, 3, 4 or 6 king-move adjacent elements, with upper left element zero.at n=3A305527
• T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3, 4 or 6 king-move adjacent elements, with upper left element zero.at n=31A305530
• T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3, 4 or 6 king-move adjacent elements, with upper left element zero.at n=32A305530