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.

A363917 a(n) = Product_{p in Factors(n)} mult(p) * n^mult(p) / p, 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 A363917 #5 Jul 19 2023 07:48:22
%S A363917 1,1,1,16,1,6,1,768,54,10,1,576,1,14,15,131072,1,1944,1,1600,21,22,1,
%T A363917 165888,250,26,19683,3136,1,900,1,83886080,33,34,35,1119744,1,38,39,
%U A363917 768000,1,1764,1,7744,12150,46,1,169869312,686,25000,51,10816,1,4251528
%N A363917 a(n) = Product_{p in Factors(n)} mult(p) * n^mult(p) / p, where Factors(n) is the integer factorization of n and mult(p) the multiplicity of the prime factor p.
%F A363917 a(n) = A363918(n) * A205959(n).
%F A363917 a(n) = A363923(n) * A005361(n).
%p A363917 A363917 := n-> local p; mul(p[2] * n^p[2] / p[1], p in ifactors(n)[2]):
%p A363917 seq(A363917(n), n = 1..54);
%Y A363917 Cf. A363923, A005361, A363918, A205959.
%K A363917 nonn
%O A363917 1,4
%A A363917 _Peter Luschny_, Jul 19 2023