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.
%I A328260 #18 Feb 16 2025 08:33:58
%S A328260 0,2,3,4,5,12,7,8,9,20,11,24,13,28,30,16,17,36,19,40,42,44,23,48,25,
%T A328260 52,27,56,29,90,31,32,66,68,70,72,37,76,78,80,41,126,43,88,90,92,47,
%U A328260 96,49,100,102,104,53,108,110,112,114,116,59,180,61,124,126,64,130,198,67,136,138,210
%N A328260 a(n) = n * omega(n).
%H A328260 Seiichi Manyama, <a href="/A328260/b328260.txt">Table of n, a(n) for n = 1..10000</a>
%H A328260 Mikhail R. Gabdullin and Vitalii V. Iudelevich, <a href="https://arxiv.org/abs/2201.09287">Numbers of the form kf(k)</a>, arXiv:2201.09287 [math.NT] (2022).
%H A328260 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/DistinctPrimeFactors.html">Distinct Prime Factors</a>
%F A328260 G.f.: Sum_{k>=1} prime(k) * x^prime(k) / (1 - x^prime(k))^2.
%F A328260 a(n) = bigomega(rad(n)^n).
%F A328260 a(n) = Sum_{d|n} A061397(n/d) * d.
%F A328260 Define f(x) = #{n <= x: a(n) <= x}. Gabdullin & Iudelevich show that f(x) ~ x/log log x. - _Charles R Greathouse IV_, Mar 16 2022
%t A328260 Table[n PrimeNu[n], {n, 1, 70}]
%t A328260 nmax = 70; CoefficientList[Series[Sum[Prime[k] x^Prime[k]/(1 - x^Prime[k])^2, {k, 1, nmax}], {x, 0, nmax}], x] // Rest
%o A328260 (Magma) [0] cat [n*(#PrimeDivisors(n)):n in [2..70]]; // _Marius A. Burtea_, Oct 10 2019
%o A328260 (PARI) a(n)=n*omega(n) \\ _Charles R Greathouse IV_, Mar 16 2022
%Y A328260 Cf. A001221, A001222, A007947, A038040, A061397, A066959, A069359, A246655 (fixed points), A293548, A298473.
%K A328260 nonn
%O A328260 1,2
%A A328260 _Ilya Gutkovskiy_, Oct 09 2019