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.

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

This page as a plain text file.
%I A262422 #6 Mar 15 2023 11:09:13
%S A262422 10,12,270,1260,15310,124572,1299070,12380940,124921710,1235566332,
%T A262422 12379963870,123483616620,1235387708110,12346379507292,
%U A262422 123476688644670,1234585890852300,12346166930494510,123457247499499452
%N A262422 Number of (3+1) X (n+1) 0..1 arrays with each row divisible by 3 and column not divisible by 3, read as a binary number with top and left being the most significant bits.
%C A262422 Row 3 of A262420.
%H A262422 R. H. Hardin, <a href="/A262422/b262422.txt">Table of n, a(n) for n = 1..210</a>
%F A262422 Empirical: a(n) = 10*a(n-1) +46*a(n-2) -460*a(n-3) -609*a(n-4) +6090*a(n-5) +2164*a(n-6) -21640*a(n-7) -1600*a(n-8) +16000*a(n-9).
%e A262422 Some solutions for n=4
%e A262422 ..1..1..0..1..1....0..1..1..1..1....0..0..0..1..1....0..0..1..1..0
%e A262422 ..0..0..1..1..0....1..1..1..1..0....1..1..0..1..1....0..1..0..0..1
%e A262422 ..0..1..1..1..1....1..1..0..1..1....1..0..0..1..0....1..0..1..0..1
%e A262422 ..0..1..1..0..0....1..0..1..0..1....1..0..1..0..1....0..1..0..0..1
%Y A262422 Cf. A262420.
%K A262422 nonn
%O A262422 1,1
%A A262422 _R. H. Hardin_, Sep 22 2015