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.

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

This page as a plain text file.
%I A262476 #4 Sep 23 2015 18:55:43
%S A262476 26,107,2622,22907,552430,8080915,194647694,3858564731,94346094606,
%T A262476 2163710210627,53883371144782,1317783399760987,33307976756396270,
%U A262476 838678794069752435,21419258810892736014,547077243280259311931
%N A262476 Number of (6+1)X(n+1) 0..1 arrays with each row divisible by 3 and each column divisible by 5, read as a binary number with top and left being the most significant bits.
%C A262476 Row 6 of A262472.
%H A262476 R. H. Hardin, <a href="/A262476/b262476.txt">Table of n, a(n) for n = 1..210</a>
%H A262476 R. H. Hardin, <a href="/A262476/a262476.txt">Empirical recurrence of order 67</a>
%F A262476 Empirical recurrence of order 67 (see link above)
%e A262476 Some solutions for n=4
%e A262476 ..0..0..0..0..0....0..0..1..1..0....1..1..0..1..1....0..0..0..0..0
%e A262476 ..0..1..1..1..1....1..1..0..0..0....0..0..0..0..0....0..0..0..0..0
%e A262476 ..0..0..1..1..0....1..1..0..0..0....1..0..0..1..0....0..1..1..0..0
%e A262476 ..0..1..0..0..1....0..0..1..1..0....0..0..0..0..0....1..0..1..0..1
%e A262476 ..1..0..0..1..0....0..0..0..0..0....1..1..0..1..1....0..1..1..1..1
%e A262476 ..0..0..1..1..0....1..1..1..1..0....0..1..0..0..1....1..0..1..0..1
%e A262476 ..1..0..0..1..0....0..0..1..1..0....1..0..0..1..0....0..0..0..1..1
%Y A262476 Cf. A262472.
%K A262476 nonn
%O A262476 1,1
%A A262476 _R. H. Hardin_, Sep 23 2015