366629

Appears in sequences

• Number of (n+3)X(1+3) 0..1 arrays with each row and column not divisible by 13, read as a binary number with top and left being the most significant bits.at n=1A263195
• Number of (n+3)X(2+3) 0..1 arrays with each row and column not divisible by 13, read as a binary number with top and left being the most significant bits.at n=0A263196
• T(n,k)=Number of (n+3)X(k+3) 0..1 arrays with each row and column not divisible by 13, read as a binary number with top and left being the most significant bits.at n=1A263198
• T(n,k)=Number of (n+3)X(k+3) 0..1 arrays with each row and column not divisible by 13, read as a binary number with top and left being the most significant bits.at n=2A263198
• Number of (n+3)X(1+3) 0..1 arrays with each row and column not divisible by 11, read as a binary number with top and left being the most significant bits.at n=1A263236
• Number of (n+3)X(2+3) 0..1 arrays with each row and column not divisible by 11, read as a binary number with top and left being the most significant bits.at n=0A263237
• T(n,k)=Number of (n+3)X(k+3) 0..1 arrays with each row and column not divisible by 11, read as a binary number with top and left being the most significant bits.at n=1A263238
• T(n,k)=Number of (n+3)X(k+3) 0..1 arrays with each row and column not divisible by 11, read as a binary number with top and left being the most significant bits.at n=2A263238
• Expansion of g.f. A(x) satisfying A(x) = x + x^2 + (A(x)^3 + 2*A(x^3))/3.at n=21A375438