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 A029767 #70 Sep 05 2025 00:22:29
%S A029767 0,1,3,14,90,744,7560,91440,1285200,20603520,371226240,7428153600,
%T A029767 163459296000,3923502105600,102017281766400,2856571067750400,
%U A029767 85698439706880000,2742370993410048000,93240969463369728000,3356681303055015936000,127554011161191014400000
%N A029767 a(n) = (n-1)!*(2^n-1) for n>=1, a(0)=0.
%C A029767 Labeled octopuses with n nodes.
%C A029767 a(n) is the number of connected endofunctions on n points such that every nonrecurrent element has at most one element in its preimage and every recurrent element has at most two elements in its preimage. - _Geoffrey Critzer_, Dec 07 2011
%D A029767 François Bergeron, Gilbert Labelle, and Pierre Leroux, Combinatorial Species and Tree-Like Structures, Cambridge University Press, 1998, pp. 12, 55, 409.
%D A029767 Richard P. Stanley, Enumerative Combinatorics, Cambridge University Press, Vol. 2, 1999; see Example 5.1.5.
%H A029767 G. C. Greubel, <a href="/A029767/b029767.txt">Table of n, a(n) for n = 0..400</a>
%H A029767 INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=498">Encyclopedia of Combinatorial Structures 498</a>.
%H A029767 INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=777">Encyclopedia of Combinatorial Structures 777</a>.
%F A029767 E.g.f.: log(1-x)-log(1-2*x).
%F A029767 From _Karol A. Penson_, Oct 15 2002: (Start)
%F A029767 Representation as an infinite sum: a(n) = (1/2)*Sum_{k>=0} (n+k)!/((k+1)!*2^k), n >= 1.
%F A029767 Representation as n-th moment of a positive function on a positive half-axis: a(n) = Integral_{x=0..oo} x^n*(1/2)*exp(-x)/x*(2*exp(1/2*x)-2), n >= 1. (End)
%F A029767 D-finite with recurrence: a(n) +3*(-n+1)*a(n-1) +2*(n-1)*(n-2)*a(n-2) = 0. - _R. J. Mathar_, Jan 08 2013
%F A029767 a(n) = n!*Sum_{k=0..n-1} binomial(n-1,k)/(k+1). - _J. M. Bergot_, Jul 30 2015
%F A029767 a(n) = (1/zeta(n)) * Integral_{x=0..1} (log(1/x))^(n-1) / (sqrt(x) * (1-x)) dx. - _Amrik Singh Nimbran_, May 06 2018
%F A029767 a(n) = polygamma(n-1, 1/2) / ((-1)^n*zeta(n)) for n >= 2. - _Amiram Eldar_, Aug 08 2025
%p A029767 with(combinat): seq(stirling1(j,1)*stirling2(j+1,2)*(-1)^(j+1), j=0..16); # _Zerinvary Lajos_, Mar 30 2007
%t A029767 a=x/(1-x); Range[0,20]! CoefficientList[Series[Log[1/(1-a)], {x,0,20}], x] (* _Geoffrey Critzer_, Dec 07 2011 *)
%t A029767 Join[{0}, Table[(n - 1)! (2^n - 1), {n, 20}]] (* _Vincenzo Librandi_, Apr 18 2015 *)
%o A029767 (Magma) [0] cat [Factorial(n-1)*(2^n-1): n in [1..20]]; // _Vincenzo Librandi_, Apr 18 2015
%o A029767 (PARI) concat([0], for(n=1,25, print1((n-1)!*(2^n -1), ", "))) \\ _G. C. Greubel_, Jan 19 2017
%o A029767 (GAP) Concatenation([0],List([1..20],n->Factorial(n-1)*(2^n-1))); # _Muniru A Asiru_, Aug 09 2018
%Y A029767 Cf. A001865.
%K A029767 nonn,easy,changed
%O A029767 0,3
%A A029767 _N. J. A. Sloane_