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.

A263052 Number of (n+1)X(n+1) 0..1 arrays with each row and column not divisible by 3, read as a binary number with top and left being the most significant bits.

This page as a plain text file.
%I A263052 #5 Oct 08 2015 14:56:37
%S A263052 2,33,1666,498597,439260642,1825928130193,26380510465997186,
%T A263052 1607516667474074649381,373842629115554331580791202,
%U A263052 353418497958270475251697468005873
%N A263052 Number of (n+1)X(n+1) 0..1 arrays with each row and column not divisible by 3, read as a binary number with top and left being the most significant bits.
%C A263052 Diagonal of A263060.
%H A263052 R. H. Hardin, <a href="/A263052/b263052.txt">Table of n, a(n) for n = 1..11</a>
%e A263052 Some solutions for n=3
%e A263052 ..1..0..1..1....1..0..0..0....0..1..0..1....1..0..1..1....1..0..1..1
%e A263052 ..0..1..0..0....0..1..1..1....0..0..1..0....0..0..0..1....0..1..0..1
%e A263052 ..1..0..1..1....1..0..1..0....0..1..0..1....1..0..1..1....0..1..1..1
%e A263052 ..0..0..1..0....1..0..1..1....1..1..1..0....1..1..1..0....0..1..0..0
%Y A263052 Cf. A263060.
%K A263052 nonn
%O A263052 1,1
%A A263052 _R. H. Hardin_, Oct 08 2015