cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A263197 Number of (n+3)X(3+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.

This page as a plain text file.
%I A263197 #3 Oct 11 2015 20:51:38
%S A263197 5486039,398648507,26007537155,1532722380695,90272986428673,
%T A263197 5321603354246163,315848755007977111
%N A263197 Number of (n+3)X(3+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.
%C A263197 Column 3 of A263198.
%e A263197 Some solutions for n=1
%e A263197 ..0..1..0..1..1..0....0..1..0..0..1..1....0..1..0..1..1..1....0..0..0..1..1..0
%e A263197 ..0..0..0..0..1..0....0..0..1..0..1..0....0..1..1..1..0..1....0..0..1..0..0..1
%e A263197 ..0..0..1..0..0..1....0..1..1..0..0..0....0..0..1..0..1..1....0..1..0..0..1..1
%e A263197 ..1..1..0..1..0..1....1..1..0..1..0..1....1..0..1..0..1..0....1..1..0..1..1..0
%Y A263197 Cf. A263198.
%K A263197 nonn
%O A263197 1,1
%A A263197 _R. H. Hardin_, Oct 11 2015