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.

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

This page as a plain text file.
%I A263122 #4 Oct 10 2015 07:08:17
%S A263122 912,28048,316392,3049840,16751376,216762400,2168966344,20154887792,
%T A263122 138240703248,1449388911184,14047136614696,130631050676464,
%U A263122 1009951152099984,9665650741329760,91463371579618312,848124382235101936
%N A263122 Number of (n+3)X(4+3) 0..1 arrays with each row divisible by 15 and column not divisible by 15, read as a binary number with top and left being the most significant bits.
%C A263122 Column 4 of A263124.
%H A263122 R. H. Hardin, <a href="/A263122/b263122.txt">Table of n, a(n) for n = 1..210</a>
%e A263122 Some solutions for n=2
%e A263122 ..1..1..0..1..0..0..1....0..0..1..1..1..1..0....0..0..0..0..0..0..0
%e A263122 ..1..1..1..1..0..0..0....1..1..1..1..0..0..0....0..1..1..1..1..0..0
%e A263122 ..0..0..0..1..1..1..1....0..0..1..1..1..1..0....1..1..1..1..0..0..0
%e A263122 ..1..1..0..1..0..0..1....0..1..0..1..1..0..1....1..0..0..1..0..1..1
%e A263122 ..1..0..0..1..0..1..1....0..1..1..1..1..0..0....0..0..0..0..0..0..0
%Y A263122 Cf. A263124.
%K A263122 nonn
%O A263122 1,1
%A A263122 _R. H. Hardin_, Oct 10 2015