21292

Appears in sequences

• a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 3.at n=15A049926
• a(1) = 0, a(2) = 1, and for n > 2, a(n) = 2*a(A252463(n)) + [n == 1 (mod 4)].at n=46A292385
• Number of nX3 0..1 arrays with every element equal to 0, 2, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=7A299216
• T(n,k) = Number of n X k 0..1 arrays with every element equal to 0, 2, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=47A299221
• T(n,k) = Number of n X k 0..1 arrays with every element equal to 0, 2, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=52A299221
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 2, 3, 4, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=47A300035
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 2, 3, 4, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=52A300035
• Number of normal patterns contiguously matched by integer partitions of n.at n=22A335838