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.

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

This page as a plain text file.
%I A352060 #13 Mar 02 2022 12:03:14
%S A352060 0,1,2,6,24,240,720,5040,40320,725760,3628800,79833600,479001600,
%T A352060 12454041600,174356582400,1307674368000,20922789888000,
%U A352060 711374856192000,6402373705728000,243290200817664000,4865804016353280000,102181884343418880000,1124000727777607680000
%N A352060 a(n) = (n - 1)! * omega(n), where omega(n) = number of distinct primes dividing n (A001221).
%F A352060 E.g.f.: -Sum_{p prime} log(1-x^p)/p.
%t A352060 a[n_] := (n-1)! * PrimeNu[n]; Array[a, 25] (* _Amiram Eldar_, Mar 02 2022 *)
%o A352060 (PARI) a(n) = (n-1)!*omega(n);
%o A352060 (PARI) my(N=40, x='x+O('x^N)); concat(0, Vec(serlaplace(-sum(k=1, N, isprime(k)*log(1-x^k)/k))))
%Y A352060 Cf. A001221, A318249, A352012, A352058, A352059.
%K A352060 nonn
%O A352060 1,3
%A A352060 _Seiichi Manyama_, Mar 02 2022