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.

Showing 1-1 of 1 results.

A336997 a(n) = n! * Sum_{d|n} 2^(d - 1) / d!.

Original entry on oeis.org

1, 4, 10, 56, 136, 1952, 5104, 94208, 605056, 7741952, 39917824, 1458295808, 6227024896, 175463616512, 2353813878784, 48886264659968, 355687428161536, 17362063156969472, 121645100409094144, 6001501553433509888, 85800344155030552576, 2248030289949388439552
Offset: 1

Views

Author

Ilya Gutkovskiy, Aug 10 2020

Keywords

Crossrefs

Programs

  • Mathematica
    Table[n! Sum[2^(d - 1)/d!, {d, Divisors[n]}], {n, 1, 22}]
    nmax = 22; CoefficientList[Series[Sum[(Exp[2 x^k] - 1)/2, {k, 1, nmax}], {x, 0, nmax}], x] Range[0, nmax]! // Rest
  • PARI
    a(n) = n! * sumdiv(n, d, 2^(d-1)/d!); \\ Michel Marcus, Aug 12 2020

Formula

E.g.f.: Sum_{k>=1} (exp(2*x^k) - 1) / 2.
a(p) = p! + 2^(p - 1), where p is prime.
Showing 1-1 of 1 results.