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.

A188963 Number of nX2 array permutations with each element moved and moved by a city block distance of no more than three.

This page as a plain text file.
%I A188963 #8 Jul 22 2025 11:29:37
%S A188963 1,9,265,8132,154564,2790864,55327556,1139362932,23084210737,
%T A188963 461656617041,9241940662537,185683704600857,3732662042406464,
%U A188963 74976134234530448,1505525933241030176,30234928280320748560
%N A188963 Number of nX2 array permutations with each element moved and moved by a city block distance of no more than three.
%C A188963 Column 2 of A188966
%H A188963 R. H. Hardin, <a href="/A188963/b188963.txt">Table of n, a(n) for n = 1..200</a>
%e A188963 Some solutions for 3X2
%e A188963 ..3..0....1..0....2..4....5..2....1..0....5..3....2..5....3..4....3..4....5..3
%e A188963 ..4..5....4..2....5..0....3..4....5..4....1..4....3..4....0..2....5..1....0..2
%e A188963 ..1..2....5..3....1..3....0..1....2..3....0..2....0..1....5..1....2..0....1..4
%K A188963 nonn
%O A188963 1,2
%A A188963 _R. H. Hardin_ Apr 14 2011