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-2 of 2 results.

A352059 a(n) = Sum_{p|n, p prime} (n-1)!/(n/p-1)!.

Original entry on oeis.org

0, 1, 2, 6, 24, 180, 720, 840, 20160, 378000, 3628800, 6985440, 479001600, 6235669440, 47221574400, 259459200, 20922789888000, 2972883513600, 6402373705728000, 20274518622758400, 1219830034655232000, 51090956251003468800, 1124000727777607680000
Offset: 1

Views

Author

Seiichi Manyama, Mar 02 2022

Keywords

Crossrefs

Programs

  • Mathematica
    a[1] = 0; a[n_] := Plus @@ ((n-1)!/(n/FactorInteger[n][[;;,1]] - 1)!); Array[a, 25] (* Amiram Eldar, Mar 02 2022 *)
  • PARI
    a(n) = my(f=factor(n)); sum(k=1, #f~, (n-1)!/(n/f[k, 1]-1)!);
    
  • PARI
    my(N=40, x='x+O('x^N)); concat(0, Vec(serlaplace(sum(k=1, N, isprime(k)*(exp(x^k)-1)/k))))

Formula

E.g.f.: Sum_{p prime} (exp(x^p) - 1)/p.

A352060 a(n) = (n - 1)! * omega(n), where omega(n) = number of distinct primes dividing n (A001221).

Original entry on oeis.org

0, 1, 2, 6, 24, 240, 720, 5040, 40320, 725760, 3628800, 79833600, 479001600, 12454041600, 174356582400, 1307674368000, 20922789888000, 711374856192000, 6402373705728000, 243290200817664000, 4865804016353280000, 102181884343418880000, 1124000727777607680000
Offset: 1

Views

Author

Seiichi Manyama, Mar 02 2022

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := (n-1)! * PrimeNu[n]; Array[a, 25] (* Amiram Eldar, Mar 02 2022 *)
  • PARI
    a(n) = (n-1)!*omega(n);
    
  • PARI
    my(N=40, x='x+O('x^N)); concat(0, Vec(serlaplace(-sum(k=1, N, isprime(k)*log(1-x^k)/k))))

Formula

E.g.f.: -Sum_{p prime} log(1-x^p)/p.
Showing 1-2 of 2 results.