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.

A262468 Number of (n+1)X(4+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 A262468 #4 Sep 23 2015 18:49:17
%S A262468 1,11,121,457,2413,22907,239281,2028469,19072681,195594107,2033050681,
%T A262468 20694058921,213513561709,2238052993835,23529091943281,
%U A262468 247329143808181,2608684587258313,27709182321786251,294872156127246841
%N A262468 Number of (n+1)X(4+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 A262468 Column 4 of A262472.
%H A262468 R. H. Hardin, <a href="/A262468/b262468.txt">Table of n, a(n) for n = 1..210</a>
%H A262468 R. H. Hardin, <a href="/A262468/a262468.txt">Empirical recurrence of order 73</a>
%F A262468 Empirical recurrence of order 73 (see link above)
%e A262468 Some solutions for n=4
%e A262468 ..0..0..0..0..0....1..0..0..1..0....0..0..1..1..0....1..0..0..1..0
%e A262468 ..0..0..0..1..1....1..0..0..1..0....0..0..1..1..0....0..0..0..0..0
%e A262468 ..0..1..1..1..1....0..0..0..0..0....1..1..1..1..0....1..0..0..1..0
%e A262468 ..0..0..0..1..1....0..0..0..0..0....0..0..1..1..0....0..0..0..0..0
%e A262468 ..0..1..1..1..1....1..0..0..1..0....1..1..0..0..0....0..0..0..0..0
%Y A262468 Cf. A262472.
%K A262468 nonn
%O A262468 1,2
%A A262468 _R. H. Hardin_, Sep 23 2015