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 A052863 #28 May 13 2022 12:05:26 %S A052863 0,0,2,6,18,65,295,1652,11032,85353,749203,7347384,79564496,942541041, %T A052863 12121319327,168145213732,2502276609008,39761200642225, %U A052863 671855234838915,12028625060491336,227451564319791336,4529507975800063337,94751047516476943359,2077192015403191663844 %N A052863 Expansion of e.g.f. log(-1/(-1+x))*exp(x) - log(-1/(-1+x)). %C A052863 Previous name was: A simple grammar. %H A052863 Seiichi Manyama, <a href="/A052863/b052863.txt">Table of n, a(n) for n = 0..450</a> %H A052863 INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=831">Encyclopedia of Combinatorial Structures 831</a> %F A052863 E.g.f.: log(-1/(-1+x))*exp(x) - log(-1/(-1+x)). %F A052863 Recurrence: {a(1)=0, a(3)=6, a(2)=2, (-n^3-2*n-3*n^2)*a(n)+(19*n+11*n^2+2*n^3+10)*a(n+1)+(-38*n-12*n^2-n^3-36)*a(n+2)+(41+26*n+4*n^2)*a(n+3)+(-17-5*n)*a(n+4)+2*a(n+5), a(4)=18, a(5)=65} %F A052863 a(n) = A002104(n)-(n-1)!. - _Vladeta Jovovic_, Apr 03 2005 %F A052863 a(n) ~ (n-1)! * (exp(1)-1). - _Vaclav Kotesovec_, Sep 29 2013 %F A052863 a(n) = Sum_{k=0..n-2} k! * binomial(n,k+1). - _Seiichi Manyama_, May 13 2022 %p A052863 spec := [S,{B=Set(Z,1 <= card),C=Cycle(Z),S=Prod(B,C)},labeled]: seq(combstruct[count](spec,size=n), n=0..20); %t A052863 CoefficientList[Series[Log[-1/(-1+x)]*E^x-Log[-1/(-1+x)], {x, 0, 20}], x]* Range[0, 20]! (* _Vaclav Kotesovec_, Sep 29 2013 *) %o A052863 (PARI) my(N=30, x='x+O('x^N)); concat([0, 0], Vec(serlaplace(-log(1-x)*(exp(x)-1)))) \\ _Seiichi Manyama_, May 13 2022 %o A052863 (PARI) a(n) = sum(k=0, n-2, k!*binomial(n, k+1)); \\ _Seiichi Manyama_, May 13 2022 %K A052863 easy,nonn %O A052863 0,3 %A A052863 encyclopedia(AT)pommard.inria.fr, Jan 25 2000 %E A052863 New name using e.g.f., _Joerg Arndt_, Sep 30 2013