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.
%I A267974 #4 Jan 23 2016 10:01:49 %S A267974 4,16,16,64,256,60,250,4096,3600,222,964,62500,216000,49284,804,3674, %T A267974 929296,12067722,10941048,646416,2872,13868,13498276,648144348, %U A267974 2208460532,519718464,8248384,10132,51917,192321424,33600202086 %N A267974 T(n,k)=Number of nXk 0..3 arrays with every repeated value in every row greater than or equal to, and in every column greater than, the previous repeated value. %C A267974 Table starts %C A267974 ......4..........16.............64..............250................964 %C A267974 .....16.........256...........4096............62500.............929296 %C A267974 .....60........3600.........216000.........12067722..........648144348 %C A267974 ....222.......49284.......10941048.......2208460532.......422888259007 %C A267974 ....804......646416......519718464.....370962601314....247835569655956 %C A267974 ...2872.....8248384....23689358848...58977586280183.135605581008614210 %C A267974 ..10132...102657424..1040125019968.8920181825287255 %C A267974 ..35383..1251956689.44297983526887 %C A267974 .122480.15001350400 %C A267974 .420752 %H A267974 R. H. Hardin, <a href="/A267974/b267974.txt">Table of n, a(n) for n = 1..60</a> %F A267974 Empirical for column k: %F A267974 k=1: [linear recurrence of order 8] %F A267974 k=2: [order 21] %F A267974 k=3: [order 40] %F A267974 Empirical for row n: %F A267974 n=1: [linear recurrence of order 8] %F A267974 n=2: [order 21] %e A267974 Some solutions for n=2 k=4 %e A267974 ..2..3..1..0....1..3..0..0....0..0..2..0....3..0..2..2....1..0..3..2 %e A267974 ..3..0..3..2....3..0..3..0....2..2..2..0....2..1..2..0....0..0..1..0 %Y A267974 Column 1 is A267928. %Y A267974 Column 2 is A267929. %K A267974 nonn,tabl %O A267974 1,1 %A A267974 _R. H. Hardin_, Jan 23 2016