cp's OEIS Frontend

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.

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

Original entry on oeis.org

1, 1, 8, 151, 4752, 214848, 12915744, 986580860, 92994888960, 10595684332288, 1436363905680384, 228679178713630208, 42284602089642237952, 8992606241049735405568, 2180532527491138011131904, 598191016068264518151780096, 184370870332464252513762869248, 63445183762362816656030378164224, 24238363163428954774170892697075712
Offset: 1

Views

Author

Paul D. Hanna, Mar 14 2018

Keywords

Comments

It is conjectured that this sequence consists entirely of integers.
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.

Crossrefs

Cf. A300871.

Programs

  • 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)}
    for(n=1, 20, print1(a(n), ", "))