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.

A262469 Number of (n+1)X(5+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 A262469 #4 Sep 23 2015 18:50:04
%S A262469 1,22,484,3055,30229,552430,11489332,198237391,3805146805,77803476910,
%T A262469 1612625364820,33119154814159,687120423331861,14386036609956334,
%U A262469 302135208204396148,6368273090580898255,134603658832727226229
%N A262469 Number of (n+1)X(5+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 A262469 Column 5 of A262472.
%H A262469 R. H. Hardin, <a href="/A262469/b262469.txt">Table of n, a(n) for n = 1..210</a>
%e A262469 Some solutions for n=4
%e A262469 ..0..0..0..1..1..0....1..1..0..0..1..1....1..0..1..1..0..1....0..0..0..0..0..0
%e A262469 ..1..1..1..1..0..0....1..0..1..0..1..0....1..0..1..1..0..1....1..1..1..1..1..1
%e A262469 ..0..1..1..1..1..0....1..1..0..0..1..1....1..0..0..1..0..0....1..1..1..0..0..1
%e A262469 ..1..1..1..1..0..0....1..0..1..0..1..0....1..0..0..1..0..0....1..1..1..1..1..1
%e A262469 ..0..1..1..0..0..0....0..0..0..0..0..0....0..0..1..0..0..1....1..1..1..0..0..1
%Y A262469 Cf. A262472.
%K A262469 nonn
%O A262469 1,2
%A A262469 _R. H. Hardin_, Sep 23 2015