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 A206385 #12 Aug 31 2025 13:16:25 %S A206385 2,33,1368,67716,3328979,164270604,8094257014,399073153303, %T A206385 19671060879306,969710249315342,47801400299066037,2356379708874988482, %U A206385 116157573684573753928,5725991875022057193833,282262740672653624738188,13914145046466342831542252,685897849965998299017561091 %N A206385 Number of n X 4 0..6 arrays with no element equal to another within a city block distance of two, and new values 0..6 introduced in row major order. %H A206385 R. H. Hardin, <a href="/A206385/b206385.txt">Table of n, a(n) for n = 1..29</a> %e A206385 Some solutions for n=4: %e A206385 ..0..1..2..0....0..1..2..3....0..1..2..3....0..1..2..3....0..1..2..0 %e A206385 ..2..3..4..5....3..4..5..6....2..3..4..5....2..3..4..5....2..3..4..5 %e A206385 ..1..5..6..3....6..2..0..1....1..5..6..0....4..5..0..6....5..6..0..1 %e A206385 ..0..2..1..4....0..1..3..2....3..4..1..2....6..1..3..4....4..1..5..6 %Y A206385 Column 4 of A206389. %K A206385 nonn,changed %O A206385 1,1 %A A206385 _R. H. Hardin_, Feb 07 2012