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.

A222847 T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every row and column least squares fitting to a positive slope straight line.

This page as a plain text file.
%I A222847 #6 Jul 23 2025 03:08:46
%S A222847 1,3,3,16,27,16,48,576,576,48,185,4896,67986,4896,185,534,63455,
%T A222847 2088576,2088576,63455,534,1873,531864,121707070,176032212,121707070,
%U A222847 531864,1873,5397,5916807,3904508304,32109350238,32109350238,3904508304,5916807,5397
%N A222847 T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every row and column least squares fitting to a positive slope straight line.
%C A222847 Table starts
%C A222847 ....1.......3.........16..........48.........185...........534.........1873
%C A222847 ....3......27........576........4896.......63455........531864......5916807
%C A222847 ...16.....576......67986.....2088576...121707070....3904508304.179900642006
%C A222847 ...48....4896....2088576...176032212.32109350238.2840442492432
%C A222847 ..185...63455..121707070.32109350238
%C A222847 ..534..531864.3904508304
%C A222847 .1873.5916807
%C A222847 .5397
%H A222847 R. H. Hardin, <a href="/A222847/b222847.txt">Table of n, a(n) for n = 1..40</a>
%e A222847 Some solutions for n=3 k=4
%e A222847 ..0..0..0..0..2....0..0..0..0..1....0..0..0..0..1....0..0..0..0..2
%e A222847 ..0..0..0..1..1....0..1..1..1..2....0..0..1..1..1....0..0..0..2..0
%e A222847 ..1..0..1..0..2....0..0..0..0..1....1..1..0..2..1....1..1..0..0..2
%e A222847 ..0..1..2..1..2....1..2..1..1..2....1..1..1..1..2....0..1..1..1..2
%K A222847 nonn,tabl
%O A222847 1,2
%A A222847 _R. H. Hardin_ Mar 07 2013