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.

A185908 Array: T(n,k) = n-1 + min{n,k}, by antidiagonals.

This page as a plain text file.
%I A185908 #13 Jul 22 2017 09:14:53
%S A185908 1,1,2,1,3,3,1,3,4,4,1,3,5,5,5,1,3,5,6,6,6,1,3,5,7,7,7,7,1,3,5,7,8,8,
%T A185908 8,8,1,3,5,7,9,9,9,9,9,1,3,5,7,9,10,10,10,10,10,1,3,5,7,9,11,11,11,11,
%U A185908 11,11,1,3,5,7,9,11,12,12,12,12,12,12,1,3,5,7,9,11,13,13,13,13,13,13,13,1,3,5,7,9,11,13,14,14,14,14,14,14,14,1,3,5,7,9,11,13,15,15,15,15,15,15,15,15,1,3,5,7,9,11,13,15,16,16,16,16,16,16,16,16,1,3,5,7,9,11,13,15,17,17,17,17,17,17,17,17,17,1,3,5,7,9,11,13,15,17
%N A185908 Array: T(n,k) = n-1 + min{n,k}, by antidiagonals.
%C A185908 A member of the accumulation chain ... < A185907 < A185908 < A185909 < ...
%C A185908 (See A144112 for definitions of weight array and accumulation array.)
%H A185908 G. C. Greubel, <a href="/A185908/b185908.txt">Table of n, a(n) for the first 50 rows, flattened</a>
%F A185908 T(n,k) = n-1 + min{n,k}, k >= 1, n >= 1.
%e A185908 Northwest corner:
%e A185908   1, 1, 1, 1, 1
%e A185908   2, 3, 3, 3, 3
%e A185908   3, 4, 5, 5, 5
%e A185908   4, 5, 6, 7, 7
%t A185908 (See A185907.)
%Y A185908 Cf. A144112, A185907, A185909.
%K A185908 nonn,tabl
%O A185908 1,3
%A A185908 _Clark Kimberling_, Feb 06 2011