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.

A202714 T(n,k)=Number of n X n 0..k arrays with row sums equal and no column sum equal to the previous.

This page as a plain text file.
%I A202714 #7 Jul 22 2025 16:47:01
%S A202714 2,3,2,4,10,38,5,28,624,838,6,60,4740,173860,75302,7,110,23036,
%T A202714 7788648,421158558,27842760,8,182,83994,147823100,189412482924,
%U A202714 8496020082856,37121438930,9,280,250668,1631287078
%N A202714 T(n,k)=Number of n X n 0..k arrays with row sums equal and no column sum equal to the previous.
%C A202714 Table starts
%C A202714 ...........2.............3............4.........5..........6......7...8.9
%C A202714 ...........2............10...........28........60........110....182.280
%C A202714 ..........38...........624.........4740.....23036......83994.250668
%C A202714 .........838........173860......7788648.147823100.1631287078
%C A202714 .......75302.....421158558.189412482924
%C A202714 ....27842760.8496020082856
%C A202714 .37121438930
%e A202714 Some solutions for n=3 k=3
%e A202714 ..1..2..2....0..3..3....2..0..3....0..1..2....3..2..2....0..0..3....2..2..1
%e A202714 ..3..1..1....3..0..3....3..2..0....0..0..3....3..3..1....0..0..3....1..3..1
%e A202714 ..1..1..3....2..3..1....3..0..2....0..3..0....3..2..2....1..2..0....2..3..0
%Y A202714 Row 2 is A006331
%K A202714 nonn,tabl
%O A202714 1,1
%A A202714 _R. H. Hardin_ Dec 23 2011