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.

A011248 Twice A000364.

Original entry on oeis.org

2, 2, 10, 122, 2770, 101042, 5405530, 398721962, 38783024290, 4809759350882, 740742376475050, 138697748786275802, 31029068327114173810, 8174145018586247784722, 2504519282807259730936570, 883087786498046209107365642, 355038783159078578873329579330, 161446598471775796124336494906562
Offset: 0

Views

Author

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := (-1)^n 4 Im[PolyLog[-2 n, I]];
    Table[a[n], {n, 0, 17}] (* Peter Luschny, Aug 18 2021 *)

Formula

E.g.f.: 2 - 2/Q(0), where Q(k)= 1 - (2*k+1)*(2*k+2)/x + 1/x*(2*k+1)*(2*k+2)/Q(k+1); (continued fraction). - Sergei N. Gladkovskii, May 01 2013
From Peter Luschny, Aug 18 2021: (Start)
a(n) = (-1)^n*4^(2*n+1)*(Bernoulli(2*n+1, 3/4) - Bernoulli(2*n+1, 1/4))/(2*n+1).
a(n) = (-1)^n*4*Im(PolyLog(-2*n, i)). (End)