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 A198979 #7 Jul 22 2025 13:07:43 %S A198979 15,8731,12662226,19622872903,30525244435834,47495195899845037, %T A198979 73900197917712351603,114985169155743145765664, %U A198979 178911424288565716160545667,278377620790460864731769016202 %N A198979 Number of nX5 0..5 arrays with values 0..5 introduced in row major order and no element equal to any horizontal or vertical neighbor. %C A198979 Column 5 of A198982 %H A198979 R. H. Hardin, <a href="/A198979/b198979.txt">Table of n, a(n) for n = 1..118</a> %F A198979 Empirical: a(n) = 1919*a(n-1) -618345*a(n-2) +87289985*a(n-3) -6569574565*a(n-4) +278610016111*a(n-5) -6494675901838*a(n-6) +68671059116490*a(n-7) +172591767439289*a(n-8) -13348281831215275*a(n-9) +160607442902203491*a(n-10) -980646097424848279*a(n-11) +3301315800351613573*a(n-12) -5146582047324378787*a(n-13) -2530332306059747340*a(n-14) +26669206285409451180*a(n-15) -51683930686978851864*a(n-16) +51325265833875086656*a(n-17) -28242314477005082400*a(n-18) +8055054564912000000*a(n-19) -914531071104000000*a(n-20) %e A198979 Some solutions with all values from 0 to 5 for n=4 %e A198979 ..0..1..0..2..3....0..1..2..3..4....0..1..2..1..0....0..1..2..3..2 %e A198979 ..1..0..1..4..2....1..0..1..4..1....1..0..1..2..3....1..0..1..0..3 %e A198979 ..0..3..0..3..1....0..3..0..3..0....0..3..0..1..2....0..3..0..4..0 %e A198979 ..3..0..4..0..5....3..0..4..1..5....3..0..4..5..1....3..0..3..2..5 %K A198979 nonn %O A198979 1,1 %A A198979 _R. H. Hardin_ Nov 01 2011