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 A009999 #45 May 12 2024 17:34:35
%S A009999 1,1,1,1,2,1,1,3,4,1,1,4,9,8,1,1,5,16,27,16,1,1,6,25,64,81,32,1,1,7,
%T A009999 36,125,256,243,64,1,1,8,49,216,625,1024,729,128,1,1,9,64,343,1296,
%U A009999 3125,4096,2187,256,1,1,10,81,512,2401,7776,15625,16384,6561,512,1
%N A009999 Triangle in which j-th entry in i-th row is (i+1-j)^j, 0<=j<=i.
%C A009999 T(n,k) is the number of ways of placing 1..k in n boxes such that each box contains at most one number, and numbers in adjacent boxes are in increasing order. This can be proved by observing that there are n-(k-1) ways of extending each of T(n-1,k-1). - _Jimin Park_, Apr 16 2023
%C A009999 The n-th diagonal consists of n^k. This can also be generated as the Akiyama-Tanigawa algorithm applied to the sequence binomial(n+k,k). - _Shel Kaphan_, May 03 2024
%D A009999 M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 24.
%H A009999 Reinhard Zumkeller, <a href="/A009999/b009999.txt">Rows n = 0..125 of triangle, flattened</a>
%H A009999 M. Abramowitz and I. A. Stegun, eds., <a href="http://www.convertit.com/Go/ConvertIt/Reference/AMS55.ASP">Handbook of Mathematical Functions</a>, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
%F A009999 T(n,0) = 1; T(n,k) = (n-k+1)*T(n-1,k-1) for k=1..n. - _Reinhard Zumkeller_, Feb 02 2014
%F A009999 T(n,k) = Sum_{i=0..k} binomial(k,i)*T(n-1-i,k-i). - _Jimin Park_, Apr 16 2023
%e A009999 Triangle begins
%e A009999 1
%e A009999 1 1
%e A009999 1 2 1
%e A009999 1 3 4 1
%e A009999 1 4 9 8 1
%e A009999 1 5 16 27 16 1
%e A009999 1 6 25 64 81 32 1
%e A009999 1 7 36 125 256 243 64 1
%e A009999 1 8 49 216 625 1024 729 128 1
%e A009999 1 9 64 343 1296 3125 4096 2187 256 1
%e A009999 1 10 81 512 2401 7776 15625 16384 6561 512 1
%p A009999 A009999 := proc(i,j) (i+1-j)^j ; end proc: # _R. J. Mathar_, Jan 16 2011
%t A009999 Table[(i+1-j)^j, {i, 0, 10}, {j, 0, i}] // Flatten (* _Jean-François Alcover_, Jan 14 2014 *)
%o A009999 (Haskell)
%o A009999 a009999 n k = (n + 1 - k) ^ k
%o A009999 a009999_row n = a009999_tabl !! n
%o A009999 a009999_tabl = [1] : map snd (iterate f ([1,1], [1,1])) where
%o A009999 f (us@(u:_), vs) = (us', 1 : zipWith (*) us' vs)
%o A009999 where us' = (u + 1) : us
%o A009999 -- _Reinhard Zumkeller_, Feb 02 2014
%Y A009999 Row sums give A026898.
%Y A009999 T(2n,n) gives A000169(n+1).
%Y A009999 Cf. A095884, A051128.
%Y A009999 Cf. A009998 (mirrored).
%K A009999 tabl,nonn,easy
%O A009999 0,5
%A A009999 _N. J. A. Sloane_
%E A009999 T(10,8) corrected by _Reinhard Zumkeller_, Feb 02 2014