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.

A071856 Factorial expansion of sqrt(2ln(2)) : sqrt(2ln(2)) = sum( n>=1, a(n)/n! ).

Original entry on oeis.org

1, 0, 1, 0, 1, 1, 5, 1, 1, 5, 5, 4, 8, 4, 9, 12, 10, 11, 11, 13, 4, 10, 2, 12, 22, 13, 8, 4, 2, 16, 22, 25, 30, 13, 12, 11, 12, 8, 11, 13, 30, 7, 34, 15, 9, 18, 41, 17, 38, 23, 21, 39, 4, 46, 45, 50, 8, 45, 57, 6, 5, 41, 62, 36, 64, 1, 26, 56, 5, 29, 13, 12, 10, 1, 55, 20, 9, 40, 36
Offset: 1

Views

Author

Benoit Cloitre, Jun 09 2002

Keywords

Comments

a(1)=1, then PARI program gives a(n) for n>1.

Crossrefs

Cf. A064619.

Programs

  • PARI
    for(n=2,200,c=sqrt(2*log(2)); print1(floor(n!*c)-n*floor((n-1)!*c),","))