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.

A203491 T(n,k)=Number of nXk 0..2 arrays with row sums equal and column sums unequal to adjacent columns.

This page as a plain text file.
%I A203491 #7 Jul 22 2025 17:17:18
%S A203491 3,6,3,12,10,3,24,80,36,3,48,556,624,82,3,96,3348,9540,3760,256,3,192,
%T A203491 20596,170868,173860,25002,676,3,384,134412,3171708,8518564,3065704,
%U A203491 171068,2050,3,768,888232,59683122,442135180,421158558,56438584,1107888
%N A203491 T(n,k)=Number of nXk 0..2 arrays with row sums equal and column sums unequal to adjacent columns.
%C A203491 Table starts
%C A203491 .3.....6......12.........24..........48..........96.........192........384
%C A203491 .3....10......80........556........3348.......20596......134412.....888232
%C A203491 .3....36.....624.......9540......170868.....3171708....59683122.1152091884
%C A203491 .3....82....3760.....173860.....8518564...442135180.24148894412
%C A203491 .3...256...25002....3065704...421158558.61706303456
%C A203491 .3...676..171068...56438584.20726134056
%C A203491 .3..2050.1107888.1004305424
%C A203491 .3..5826.7411872
%C A203491 .3.17568
%C A203491 .3
%H A203491 R. H. Hardin, <a href="/A203491/b203491.txt">Table of n, a(n) for n = 1..58</a>
%e A203491 Some solutions for n=5 k=3
%e A203491 ..0..0..1....0..0..2....1..2..1....0..1..2....0..2..0....2..2..1....1..1..0
%e A203491 ..0..0..1....2..0..0....2..1..1....0..1..2....0..0..2....2..1..2....1..1..0
%e A203491 ..0..1..0....0..1..1....1..2..1....2..1..0....2..0..0....2..1..2....1..1..0
%e A203491 ..0..0..1....2..0..0....2..1..1....1..1..1....2..0..0....1..2..2....0..0..2
%e A203491 ..0..0..1....0..0..2....1..2..1....2..0..1....1..1..0....2..1..2....2..0..0
%Y A203491 Diagonal is A202712
%K A203491 nonn,tabl
%O A203491 1,1
%A A203491 _R. H. Hardin_ Jan 02 2012