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.

A263125 Number of (1+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 A263125 #4 Oct 10 2015 07:14:05
%S A263125 14,36,168,912,52446,502800,5950176,79674864,1150876510,15833668596,
%T A263125 219803283432,3071596572336,43104942680030,602744107942848,
%U A263125 8433329018112000,118048179597057360,1652891095755395934
%N A263125 Number of (1+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 A263125 Row 1 of A263124.
%H A263125 R. H. Hardin, <a href="/A263125/b263125.txt">Table of n, a(n) for n = 1..210</a>
%e A263125 Some solutions for n=4
%e A263125 ..1..0..0..1..0..1..1....0..0..0..1..1..1..1....1..1..1..1..0..0..0
%e A263125 ..0..0..1..1..1..1..0....0..0..0..0..0..0..0....0..0..0..0..0..0..0
%e A263125 ..0..0..0..0..0..0..0....1..0..0..1..0..1..1....1..1..0..1..0..0..1
%e A263125 ..0..1..1..1..1..0..0....0..1..1..1..1..0..0....0..0..1..1..1..1..0
%Y A263125 Cf. A263124.
%K A263125 nonn
%O A263125 1,1
%A A263125 _R. H. Hardin_, Oct 10 2015