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.

A363918 a(n) = Product_{p in Factors(n)} mult(p)*n^(mult(p) - 1), where Factors(n) is the integer factorization of n and mult(p) the multiplicity of the prime factor p.

This page as a plain text file.
%I A363918 #9 Jul 19 2023 07:48:16
%S A363918 1,1,1,8,1,1,1,192,18,1,1,24,1,1,1,16384,1,36,1,40,1,1,1,1728,50,1,
%T A363918 2187,56,1,1,1,5242880,1,1,1,5184,1,1,1,4800,1,1,1,88,90,1,1,442368,
%U A363918 98,100,1,104,1,8748,1,9408,1,1,1,120,1,1,126,6442450944,1,1,1,136
%N A363918 a(n) = Product_{p in Factors(n)} mult(p)*n^(mult(p) - 1), where Factors(n) is the integer factorization of n and mult(p) the multiplicity of the prime factor p.
%F A363918 a(n) / A363919(n) = A005361(n).
%F A363918 a(n) * A205959(n) = A005361(n) * A363923(n) = A363917(n).
%p A363918 a := n -> local p: mul(p[2] * n^(p[2] - 1), p in ifactors(n)[2]):
%p A363918 seq(a(n), n = 1..68);
%o A363918 (PARI) a(n) = my(f=factor(n)[, 2]); vecprod(f)*n^(vecsum(f)-#f); \\ _Michel Marcus_, Jul 19 2023
%Y A363918 Cf. A363919, A363923, A005361, A205959, A303915, A363917.
%K A363918 nonn
%O A363918 1,4
%A A363918 _Peter Luschny_, Jul 19 2023