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.

A263059 Number of (n+1)X(7+1) 0..1 arrays with each row 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 A263059 #4 Oct 08 2015 15:01:15
%S A263059 170,113486,19499266,4880746710,830550961170,155157177242886,
%T A263059 26380510465997186,4591006241105432150,780492175300947773170,
%U A263059 133462112418824638334886,22688696181791779887035106
%N A263059 Number of (n+1)X(7+1) 0..1 arrays with each row and column not divisible by 3, read as a binary number with top and left being the most significant bits.
%C A263059 Column 7 of A263060.
%H A263059 R. H. Hardin, <a href="/A263059/b263059.txt">Table of n, a(n) for n = 1..210</a>
%F A263059 Empirical: a(n) = 170*a(n-1) +12088*a(n-2) -2054960*a(n-3) -43463646*a(n-4) +7388819820*a(n-5) +66398454660*a(n-6) -11287737292200*a(n-7) -47263888640505*a(n-8) +8034861068885850*a(n-9) +16948827007298316*a(n-10) -2881300591240713720*a(n-11) -3142452853334937648*a(n-12) +534216985066939400160*a(n-13) +298488023933669046336*a(n-14) -50742964068723737877120*a(n-15) -13934074238604397209600*a(n-16) +2368792620562747525632000*a(n-17) +287178122770920663040000*a(n-18) -48820280871056512716800000*a(n-19) -2061386929701535744000000*a(n-20) +350435778049261076480000000*a(n-21)
%e A263059 Some solutions for n=2
%e A263059 ..1..0..1..1..1..1..1..1....1..0..0..0..1..1..1..1....1..1..0..1..0..1..1..0
%e A263059 ..1..0..1..0..0..0..0..1....0..0..1..1..0..0..1..0....0..1..0..0..1..1..0..0
%e A263059 ..1..1..1..1..1..1..0..1....1..1..0..0..0..0..1..0....0..1..1..0..0..1..1..1
%Y A263059 Cf. A263060.
%K A263059 nonn
%O A263059 1,1
%A A263059 _R. H. Hardin_, Oct 08 2015