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.

A252536 Number of (4+2) X (n+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 2 3 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 2 3 6 or 7.

This page as a plain text file.
%I A252536 #9 Dec 05 2018 03:39:29
%S A252536 535,426,610,790,1592,2440,3160,6368,9760,12640,25472,39040,50560,
%T A252536 101888,156160,202240,407552,624640,808960,1630208,2498560,3235840,
%U A252536 6520832,9994240,12943360,26083328,39976960,51773440,104333312,159907840
%N A252536 Number of (4+2) X (n+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 2 3 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 2 3 6 or 7.
%H A252536 R. H. Hardin, <a href="/A252536/b252536.txt">Table of n, a(n) for n = 1..210</a>
%F A252536 Empirical: a(n) = 4*a(n-3) for n>5.
%F A252536 Empirical g.f.: x*(535 + 426*x + 610*x^2 - 1350*x^3 - 112*x^4) / (1 - 4*x^3). - _Colin Barker_, Dec 04 2018
%e A252536 Some solutions for n=4:
%e A252536 ..3..2..2..3..2..2....0..3..0..0..3..3....1..2..0..1..1..0....0..0..2..0..0..2
%e A252536 ..2..3..2..2..3..2....1..1..0..1..1..0....0..1..1..0..1..1....0..1..1..0..1..1
%e A252536 ..3..3..1..3..3..0....0..1..1..0..1..1....0..2..0..0..2..0....1..0..1..1..0..1
%e A252536 ..3..2..2..3..2..2....0..3..0..0..2..0....1..1..0..1..1..0....0..0..2..0..0..2
%e A252536 ..2..3..2..2..3..2....1..1..0..1..1..0....0..1..1..0..1..1....0..1..1..0..1..1
%e A252536 ..3..0..0..3..3..1....0..1..1..0..1..1....0..3..0..0..2..0....1..0..1..1..0..2
%Y A252536 Row 4 of A252532.
%K A252536 nonn
%O A252536 1,1
%A A252536 _R. H. Hardin_, Dec 18 2014