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.

A221337 T(n,k)=Number of nXk arrays of occupancy after each element stays put or moves to some king-move neighbor, with every occupancy equal to zero or two.

This page as a plain text file.
%I A221337 #5 Jul 23 2025 01:51:05
%S A221337 0,2,2,0,6,0,4,20,20,4,0,68,0,68,0,8,232,790,790,232,8,0,792,0,10704,
%T A221337 0,792,0,16,2704,34042,142792,142792,34042,2704,16,0,9232,0,1937900,0,
%U A221337 1937900,0,9232,0,32,31520,1470618,26264018
%N A221337 T(n,k)=Number of nXk arrays of occupancy after each element stays put or moves to some king-move neighbor, with every occupancy equal to zero or two.
%C A221337 Table starts
%C A221337 ..0....2.....0.......4......0.......8........0......16.....0.32
%C A221337 ..2....6....20......68....232.....792.....2704....9232.31520
%C A221337 ..0...20.....0.....790......0...34042........0.1470618
%C A221337 ..4...68...790...10704.142792.1937900.26264018
%C A221337 ..0..232.....0..142792......0
%C A221337 ..8..792.34042.1937900
%C A221337 ..0.2704.....0
%C A221337 .16.9232
%C A221337 ..0
%e A221337 Some solutions for n=3 k=4
%e A221337 ..0..2..2..2....2..0..0..0....2..0..2..0....0..0..2..0....0..2..2..0
%e A221337 ..2..0..0..0....2..2..2..0....0..0..2..0....2..2..0..0....2..2..0..0
%e A221337 ..0..2..0..2....0..2..0..2....2..0..2..2....2..0..2..2....0..0..2..2
%Y A221337 Column 1 is A077957
%Y A221337 Column 2 is A006012
%K A221337 nonn,tabl
%O A221337 1,2
%A A221337 _R. H. Hardin_ Jan 11 2013