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.

A262330 Number of (n+1) X (6+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 A262330 #6 Jun 09 2023 22:54:55
%S A262330 43,261,10935,252097,10789339,394241389,16940254423,699094613961,
%T A262330 30056993215803,1279198648576981,55003871225837815,
%U A262330 2359070696262035857,101439297012081117979,4359072407628680510589,187439773845177573589143
%N A262330 Number of (n+1) X (6+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 A262330 Column 6 of A262332.
%H A262330 R. H. Hardin, <a href="/A262330/b262330.txt">Table of n, a(n) for n = 1..210</a>
%F A262330 Empirical: a(n) = 43*a(n-1) +793*a(n-2) -34099*a(n-3) -191667*a(n-4) +8241681*a(n-5) +20015927*a(n-6) -860684861*a(n-7) -980560940*a(n-8) +42164120420*a(n-9) +22309346640*a(n-10) -959301905520*a(n-11) -209959392832*a(n-12) +9028253891776*a(n-13) +540712883200*a(n-14) -23250653977600*a(n-15).
%e A262330 Some solutions for n=3
%e A262330 ..1..1..0..1..1..0..0....0..0..0..0..0..0..0....0..0..1..1..1..1..0
%e A262330 ..1..1..1..0..1..0..1....0..0..0..0..1..1..0....0..1..0..1..0..1..0
%e A262330 ..0..0..1..0..1..0..1....0..0..0..0..1..1..0....1..1..0..0..0..1..1
%e A262330 ..0..0..0..1..1..0..0....0..0..0..0..0..0..0....1..0..1..0..1..1..1
%Y A262330 Cf. A262332.
%K A262330 nonn
%O A262330 1,1
%A A262330 _R. H. Hardin_, Sep 18 2015