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.

A206392 Number of n X 4 0..5 arrays with no element equal to another within a city block distance of two, and new values 0..5 introduced in row major order.

This page as a plain text file.
%I A206392 #7 Jul 16 2025 11:33:40
%S A206392 2,25,206,1931,16784,151630,1343560,12046648,107401612,960610876,
%T A206392 8576723918,76644197120,684569775162,6116039277778,54633888067900,
%U A206392 488076198634430,4360092827131800,38950530867108738,347957262094712236
%N A206392 Number of n X 4 0..5 arrays with no element equal to another within a city block distance of two, and new values 0..5 introduced in row major order.
%C A206392 Column 4 of A206396.
%H A206392 R. H. Hardin, <a href="/A206392/b206392.txt">Table of n, a(n) for n = 1..210</a>
%F A206392 Empirical: a(n) = 14*a(n-1) -32*a(n-2) -281*a(n-3) +1738*a(n-4) -1728*a(n-5) -9767*a(n-6) +21963*a(n-7) -7410*a(n-8) +5706*a(n-9) -19704*a(n-10) +6028*a(n-11) +2512*a(n-12) -2176*a(n-13) for n>15.
%e A206392 Some solutions for n=4
%e A206392 ..0..1..2..0....0..1..2..0....0..1..2..3....0..1..2..3....0..1..2..3
%e A206392 ..2..3..4..5....2..3..4..5....4..3..0..5....4..3..0..4....3..4..5..0
%e A206392 ..4..5..0..1....1..5..0..1....5..2..4..1....1..2..5..1....1..0..3..1
%e A206392 ..0..1..2..3....3..4..2..3....0..1..5..3....0..4..3..2....2..5..4..2
%Y A206392 Cf. A206396.
%K A206392 nonn
%O A206392 1,1
%A A206392 _R. H. Hardin_, Feb 07 2012