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 A324580 #8 Mar 09 2019 19:23:53
%S A324580 0,2,6,18,36,90,30,70,120,270,450,990,300,650,1050,2250,3600,7650,
%T A324580 2250,4750,7500,15750,24750,51750,15000,31250,48750,101250,157500,
%U A324580 326250,210,434,672,1386,2142,4410,1260,2590,3990,8190,12600,25830,7350,15050,23100,47250,72450,148050,42000,85750,131250,267750,409500
%N A324580 a(n) = n * A276086(n).
%H A324580 Antti Karttunen, <a href="/A324580/b324580.txt">Table of n, a(n) for n = 0..10000</a>
%H A324580 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%H A324580 <a href="/index/Pri#primorial_numbers">Index entries for sequences related to primorial numbers</a>
%F A324580 a(n) = n * A276086(n).
%F A324580 For n >= 0, a(A002110(n)) = A002110(1+n).
%o A324580 (PARI)
%o A324580 A276086(n) = { my(i=0,m=1,pr=1,nextpr); while((n>0),i=i+1; nextpr = prime(i)*pr; if((n%nextpr),m*=(prime(i)^((n%nextpr)/pr));n-=(n%nextpr));pr=nextpr); m; };
%o A324580 A324580(n) = n*A276086(n);
%Y A324580 Cf. A002110, A276086, A324198, A324577, A324578, A324579, A324582.
%K A324580 nonn
%O A324580 0,2
%A A324580 _Antti Karttunen_, Mar 09 2019