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 A346101 #14 Jul 11 2021 10:24:12
%S A346101 1,2,3,6,9,18,5,10,15,30,45,90,125,250,375,750,1125,2250,25,50,75,150,
%T A346101 225,450,625,1250,1875,3750,5625,11250,7,14,21,42,63,126,35,70,105,
%U A346101 210,315,630,875,1750,2625,5250,7875,15750,175,350,525,1050,1575,3150,4375,8750,13125,26250,39375,78750,2401,4802,7203,14406
%N A346101 "Inverted variant" of A276086: a(n) = A276086(A289234(n)).
%H A346101 Antti Karttunen, <a href="/A346101/b346101.txt">Table of n, a(n) for n = 0..16170</a>
%H A346101 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A346101 a(n) = A276086(A289234(n)).
%o A346101 (PARI)
%o A346101 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A346101 A289234(n) = { my(pr=1, p=2, v=0); while(n>0, my (d=n%p); if(d>0, v += pr * lift(1/Mod(d, p))); pr *= p; n \= p; p = nextprime(1+p)); return(v); }; \\ From A289234.
%o A346101 A346101(n) = A276086(A289234(n));
%o A346101 (PARI) A346101(n) = { my(p=2, m=1); while(n>0, my(d=n%p); if(d>0, m *= p^lift(1/Mod(d, p))); n \= p; p = nextprime(1+p)); return(m); };
%Y A346101 Cf. A276086, A289234, A344760.
%Y A346101 Cf. also A328624, A328627, A346102.
%K A346101 nonn,look
%O A346101 0,2
%A A346101 _Antti Karttunen_, Jul 10 2021