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.

A262329 Number of (n+1)X(5+1) 0..1 arrays with each row and column 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 A262329 #4 Sep 18 2015 07:34:56
%S A262329 22,99,2106,26131,570922,10789339,237172426,5028462531,110616890922,
%T A262329 2411745951979,53057962551946,1164684632805331,25623040149388522,
%U A262329 563395838251985019,12394707380225550666,272646042792758242531
%N A262329 Number of (n+1)X(5+1) 0..1 arrays with each row and column divisible by 3, read as a binary number with top and left being the most significant bits.
%C A262329 Column 5 of A262332.
%H A262329 R. H. Hardin, <a href="/A262329/b262329.txt">Table of n, a(n) for n = 1..210</a>
%F A262329 Empirical: a(n) = 22*a(n-1) +215*a(n-2) -4730*a(n-3) -14143*a(n-4) +311146*a(n-5) +364285*a(n-6) -8014270*a(n-7) -3615956*a(n-8) +79551032*a(n-9) +9486400*a(n-10) -208700800*a(n-11)
%e A262329 Some solutions for n=4
%e A262329 ..0..0..1..1..0..0....1..0..0..1..0..0....1..0..0..1..1..1....0..1..1..1..1..0
%e A262329 ..1..1..1..1..1..1....0..0..1..1..0..0....0..0..0..1..1..0....1..1..0..1..1..0
%e A262329 ..1..0..0..1..1..1....1..0..1..0..1..0....0..0..1..0..0..1....1..0..1..0..1..0
%e A262329 ..0..0..1..1..1..1....0..1..1..1..1..0....1..0..1..0..1..0....1..1..0..0..1..1
%e A262329 ..0..1..1..0..1..1....1..1..1..1..0..0....0..0..0..0..1..1....1..1..1..0..0..1
%Y A262329 Cf. A262332.
%K A262329 nonn
%O A262329 1,1
%A A262329 _R. H. Hardin_, Sep 18 2015