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.

A027643 Numerators of poly-Bernoulli numbers B_n^(k) with k=2.

Original entry on oeis.org

1, 1, -1, -1, 7, 1, -38, -5, 11, 7, -3263, -15, 13399637, 7601, -8364, -91, 1437423473, 3617, -177451280177, -745739, 166416763419, 3317609, -17730427802974, -5981591, 51257173898346323, 5436374093, -107154672791057, -213827575
Offset: 0

Views

Author

Keywords

Crossrefs

Programs

  • Magma
    A027643:= func< n,k | Numerator( (&+[(-1)^(j+n)*Factorial(j)*StirlingSecond(n, j)/(j+1)^k: j in [0..n]]) ) >;
    [A027643(n,2): n in [0..30]]; // G. C. Greubel, Aug 02 2022
    
  • Maple
    a := n -> numer((-1)^n*add( (-1)^m*m!*Stirling2(n, m)/(m+1)^2, m=0..n)):
    seq(a(n), n=0..27);
  • Mathematica
    k=2; Table[Numerator[(-1)^n Sum[(-1)^m m! StirlingS2[n, m]/(m+1)^k, {m, 0, n}]], {n, 0, 27}] (* Michael De Vlieger, Oct 28 2015 *)
  • SageMath
    def A027643(n,k): return numerator( sum((-1)^(n+j)*factorial(j)*stirling_number2(n,j)/(j+1)^k for j in (0..n)) )
    [A027643(n,2) for n in (0..30)] # G. C. Greubel, Aug 02 2022

Formula

a(n) = numerator of Sum_{k=0..n} W(n,k)*h(k+1) with W(n,k) = (-1)^(n-k)*k!* Stirling2(n+1,k+1) the Worpitzky numbers and h(n) = Sum_{k=1..n} 1/k^2 the generalized harmonic numbers of order 2. - Peter Luschny, Sep 28 2017