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.

A263126 Number of (2+3)X(n+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 A263126 #3 Oct 10 2015 07:15:22
%S A263126 29,148,1664,28048,887805,21881010,583371100,16245282600,474350516221,
%T A263126 13614396562020,392816467987240,11368863651747952,329881756982246141,
%U A263126 9560756720430691666
%N A263126 Number of (2+3)X(n+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 A263126 Row 2 of A263124.
%e A263126 Some solutions for n=4
%e A263126 ..0..1..0..1..1..0..1....0..0..1..1..1..1..0....0..1..1..1..1..0..0
%e A263126 ..1..1..0..1..0..0..1....1..1..0..1..0..0..1....1..0..0..1..0..1..1
%e A263126 ..1..0..1..1..0..1..0....1..1..0..1..0..0..1....0..0..0..1..1..1..1
%e A263126 ..0..0..0..1..1..1..1....1..1..1..1..0..0..0....1..1..1..1..0..0..0
%e A263126 ..1..1..1..1..0..0..0....0..0..0..1..1..1..1....1..1..1..1..0..0..0
%Y A263126 Cf. A263124.
%K A263126 nonn
%O A263126 1,1
%A A263126 _R. H. Hardin_, Oct 10 2015