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 A006675 M2079 #23 Dec 18 2021 22:20:31
%S A006675 0,0,2,15,104,770,6264,56196,554112,5973264,69998400,886897440,
%T A006675 12089295360,176484597120,2748022986240,45472329504000,
%U A006675 796983880089600,14751208762214400,287543058350284800
%N A006675 Number of paths through an array.
%D A006675 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A006675 T. D. Noe, <a href="/A006675/b006675.txt">Table of n, a(n) for n=0..100</a>
%H A006675 A. M. Khidr and B. S. El-Desouky, <a href="http://dx.doi.org/10.1016/S0195-6698(84)80018-9">A symmetric sum involving the Stirling numbers of the first kind</a>, European J. Combin., 5 (1984), 51-54.
%F A006675 a(n) = n*n! * (H(n) - 1) where H(n) = Sum_{k=1..n} 1/k.
%F A006675 E.g.f. A(x) = x*(1-x)^-2 * (-log(1-x)).
%F A006675 a(n) = A001705(n) - A000254(n). - _Peter Bala_, Feb 12 2019
%e A006675 x*(1-x)^-2 * (-log(1-x)) = x^2 + (5/2)*x^3 + (13/3)*x^4 + (77/12)*x^5 + ...
%t A006675 a[n_] := n*n!*(HarmonicNumber[n]-1); Table[a[n], {n, 0, 18}] (* _Jean-François Alcover_, Nov 28 2011 *)
%Y A006675 Cf. A000254, A001705.
%K A006675 nonn,easy,nice
%O A006675 0,3
%A A006675 _N. J. A. Sloane_
%E A006675 More terms from Joe Keane (jgk(AT)jgk.org)