The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A300872 a(n) = A300871(n) / (n*(n+1)/2). 2

%I

%S 1,1,8,151,4752,214848,12915744,986580860,92994888960,10595684332288,

%T 1436363905680384,228679178713630208,42284602089642237952,

%U 8992606241049735405568,2180532527491138011131904,598191016068264518151780096,184370870332464252513762869248,63445183762362816656030378164224,24238363163428954774170892697075712

%N a(n) = A300871(n) / (n*(n+1)/2).

%C It is conjectured that this sequence consists entirely of integers.

%C O.g.f. G(x) of A300871 satisfies: [x^n] exp( n*(n+1) * G(x) ) = n*(n+1) * [x^(n-1)] exp( n*(n+1) * G(x) ) for n>=1.

%H Paul D. Hanna, <a href="/A300872/b300872.txt">Table of n, a(n) for n = 1..200</a>

%o (PARI) {a(n) = my(A=[1]); for(i=1, n+1, A=concat(A, 0); V=Vec(Ser(A)^((#A-1)*(#A))); A[#A] = ((#A-1)*(#A)*V[#A-1] - V[#A])/(#A-1)/(#A) ); (1/(n*(n+1)/2))*polcoeff( log(Ser(A)), n)}

%o for(n=1, 20, print1(a(n), ", "))

%Y Cf. A300871.

%K nonn

%O 1,3

%A _Paul D. Hanna_, Mar 14 2018

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 28 22:40 EST 2020. Contains 331328 sequences. (Running on oeis4.)