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 A082171 #39 Jan 20 2024 09:27:46
%S A082171 1,1,3,1,8,39,1,15,176,1206,1,24,495,7784,69189,1,35,1104,29430,
%T A082171 585408,6416568,1,48,2135,84600,2791125,67481928,881032059,1,63,3744,
%U A082171 204470,9841728,389244600,11111547520,168514815360,1,80,6111,437616,28569765,1627740504,75325337235,2483829653544,42934911510249
%N A082171 A subclass of quasi-acyclic automata with 2 inputs, n transient and k absorbing labeled states; square array T(n,k) read by descending antidiagonals (n >= 0 and k >= 1).
%C A082171 Array read by descending antidiagonals: (0,1), (0,2), (1,1), (0,3), ...
%C A082171 The first column is A082159; i.e., T(n,k=1) = A082159(n). [The number n of transient states in the name of square array T(n,k) does not include the pre-dead transient state, which is, however, included in the name of A082159. See Section 3.1 in Liskovets (2006). - _Petros Hadjicostas_, Mar 07 2021]
%H A082171 G. C. Greubel, <a href="/A082171/b082171.txt">Antidiagonals n = 0..50, flattened</a>
%H A082171 Valery A. Liskovets, <a href="http://igm.univ-mlv.fr/~fpsac/FPSAC03/ARTICLES/5.pdf">Exact enumeration of acyclic automata</a>, Proc. 15th Conf. "Formal Power Series and Algebr. Combin. (FPSAC'03)", 2003.
%H A082171 Valery A. Liskovets, <a href="http://dx.doi.org/10.1016/j.dam.2005.06.009">Exact enumeration of acyclic deterministic automata</a>, Discrete Appl. Math., 154, No. 3 (2006), 537-551.
%F A082171 T(n, k) = S_2(n, k) where S_2(0, k) := 1 and S_2(n, k) := Sum_{i=0..n-1} binomial(n, i)*(-1)^(n-i-1)*((i + k + 1)^2 - 1)^(n-i)*S_2(i, k) for n > 0.
%e A082171 Array T(n,k) (with rows n >= 0 and columns k >= 1) begins:
%e A082171 1, 1, 1, 1, 1, ...;
%e A082171 3, 8, 15, 24, 35, ...;
%e A082171 39, 176, 495, 1104, 2135, ...;
%e A082171 1206, 7784, 29430, 84600, 204470, ...;
%e A082171 69189, 585408, 2791125, 9841728, 28569765, ...;
%e A082171 6416568, 67481928, 389244600, 1627740504, ...;
%e A082171 881032059, 11111547520, 75325337235, ...;
%e A082171 ...
%e A082171 Triangular array A(n,k) = T(k-1, n-k+1) (with rows n >= 1 and columns k = 1..n), read from the antidiagonals downwards of square array T:
%e A082171 1;
%e A082171 1, 3,
%e A082171 1, 8, 39;
%e A082171 1, 15, 176, 1206;
%e A082171 1, 24, 495, 7784, 69189;
%e A082171 1, 35, 1104, 29430, 585408, 6416568;
%e A082171 1, 48, 2135, 84600, 2791125, 67481928, 881032059;
%e A082171 ...
%t A082171 T[0, _] = 1; T[n_, k_] := T[n, k] = Sum[Binomial[n, i] (-1)^(n - i - 1)*((i + k + 1)^2 - 1)^(n - i)*T[i, k], {i, 0, n - 1}];
%t A082171 Table[T[n - k - 1, k], {n, 1, 10}, {k, n - 1, 1, -1}] // Flatten (* _Jean-François Alcover_, Aug 29 2019 *)
%o A082171 (PARI) lista(nn,kk)={my(T=matrix(nn+1,kk)); for(n=1, nn+1, for(k=1, kk, T[n,k] = if(n==1, 1, sum(i=0,n-2, binomial(n-1, i)*(-1)^(n-i-2)*((i + k + 1)^2 - 1)^(n-i-1)*T[i+1, k])))); T;} \\ _Petros Hadjicostas_, Mar 07 2021
%o A082171 (Magma)
%o A082171 function A(n,k)
%o A082171 if n eq 0 then return 1;
%o A082171 else return (&+[(-1)^(n-j+1)*Binomial(n,j)*((k+j+1)^2-1)^(n-j)*A(j,k): j in [0..n-1]]);
%o A082171 end if;
%o A082171 end function;
%o A082171 A082171:= func< n,k | A(k,n-k+1) >;
%o A082171 [A082171(n,k): k in [0..n], n in [0..12]]; // _G. C. Greubel_, Jan 19 2024
%o A082171 (SageMath)
%o A082171 @CachedFunction
%o A082171 def A(n,k):
%o A082171 if n==0: return 1
%o A082171 else: return sum((-1)^(n-j+1)*binomial(n,j)*((k+j+1)^2-1)^(n-j)*A(j,k) for j in range(n))
%o A082171 def A082171(n,k): return A(k,n-k+1)
%o A082171 flatten([[A082171(n,k) for k in range(n+1)] for n in range(12)]) # _G. C. Greubel_, Jan 19 2024
%Y A082171 Cf. A082159, A082163, A082169.
%K A082171 easy,nonn,tabl
%O A082171 0,3
%A A082171 _Valery A. Liskovets_, Apr 09 2003
%E A082171 Name clarified by _Petros Hadjicostas_, Mar 07 2021