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.
%I A280438 #7 Feb 13 2019 11:00:56 %S A280438 10,68,136,232,360,548,834,1284,2008,3188,5128,8332,13638,22436,37032, %T A280438 61248,101416,168020,278410,461284,764088,1265228,2094216,3464892, %U A280438 5730190,9472388,15651784,25851544,42680808,70438148,116203218,191632452 %N A280438 Number of n X 6 0..1 arrays with no element equal to more than one of its horizontal and vertical neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. %H A280438 R. H. Hardin, <a href="/A280438/b280438.txt">Table of n, a(n) for n = 1..210</a> %F A280438 Empirical: a(n) = 4*a(n-1) - 4*a(n-2) - 2*a(n-3) + 4*a(n-4) - a(n-6) for n>7. %F A280438 Empirical g.f.: 2*x*(5 + 14*x - 48*x^2 - 10*x^3 + 36*x^4 + 18*x^5 + 6*x^6) / ((1 - x)^2*(1 - x - x^2)^2). - _Colin Barker_, Feb 13 2019 %e A280438 Some solutions for n=4: %e A280438 ..0..1..0..1..0..1. .0..1..0..0..1..1. .0..0..1..1..0..0. .0..0..1..0..1..0 %e A280438 ..0..0..1..0..1..0. .1..0..1..1..0..1. .0..1..0..0..1..1. .1..1..0..1..0..1 %e A280438 ..0..1..0..1..0..1. .0..1..0..0..1..0. .1..0..1..1..0..0. .0..0..1..0..1..0 %e A280438 ..1..0..1..0..1..0. .1..0..1..1..0..1. .0..1..0..0..1..1. .1..1..0..1..1..1 %Y A280438 Column 6 of A280440. %K A280438 nonn %O A280438 1,1 %A A280438 _R. H. Hardin_, Jan 03 2017