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.

A268204 T(n,k)=Number of nXk 0..k arrays with every repeated value in every row and column greater than the previous repeated value.

This page as a plain text file.
%I A268204 #4 Jan 28 2016 16:03:56
%S A268204 2,9,4,60,81,6,570,3600,576,9,6960,324900,178068,3969,12,104006,
%T A268204 48441600,157322070,8459154,25281,16,1837752,10817248036,292870561470,
%U A268204 73055876226,376812420,155236,20,37478718,3377332413504,994136348047368
%N A268204 T(n,k)=Number of nXk 0..k arrays with every repeated value in every row and column greater than the previous repeated value.
%C A268204 Table starts
%C A268204 ..2......9..........60............570.............6960...............104006
%C A268204 ..4.....81........3600.........324900.........48441600..........10817248036
%C A268204 ..6....576......178068......157322070.....292870561470......994136348047368
%C A268204 ..9...3969.....8459154....73055876226.1699631089239529.87855957137937824257
%C A268204 .12..25281...376812420.32082001964881
%C A268204 .16.155236.16109362560
%C A268204 .20.915849
%C A268204 .25
%H A268204 R. H. Hardin, <a href="/A268204/b268204.txt">Table of n, a(n) for n = 1..40</a>
%e A268204 Some solutions for n=3 k=4
%e A268204 ..0..0..2..4....0..0..3..3....0..0..2..2....0..0..4..3....0..0..2..4
%e A268204 ..0..1..3..1....0..0..1..0....0..1..0..3....0..1..4..2....0..1..3..2
%e A268204 ..1..3..3..0....1..1..3..4....1..3..4..0....1..3..2..1....1..2..3..3
%Y A268204 Column 1 is A002620(n+2).
%Y A268204 Column 2 is A267961.
%Y A268204 Column 3 is A267930.
%K A268204 nonn,tabl
%O A268204 1,1
%A A268204 _R. H. Hardin_, Jan 28 2016