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 A346252 #12 Jan 16 2022 15:22:46 %S A346252 0,1,2,7,1,5,2,9,16,47,11,37,4,13,22,59,17,49,1,7,13,41,8,31,3,11,19, %T A346252 53,14,43,2,11,20,61,13,47,24,83,142,389,107,319,38,111,184,473,149, %U A346252 403,17,69,121,347,86,277,31,97,163,431,128,361,4,15,26,73,19,59,34,103,172,449,137,379,48,131,214,533,179,463,27,89 %N A346252 a(n) = A342002(A328622(n)). %H A346252 Antti Karttunen, <a href="/A346252/b346252.txt">Table of n, a(n) for n = 0..13860</a> %H A346252 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a> %F A346252 a(n) = A342001(A346102(n)) = A342002(A328622(n)). %o A346252 (PARI) %o A346252 A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1])); %o A346252 A003557(n) = (n/factorback(factorint(n)[, 1])); %o A346252 A342001(n) = (A003415(n) / A003557(n)); %o A346252 A346102(n) = { my(m=1, p=2); while(n, m *= (p^((((p%2)+1)*n)%p)); n = n\p; p = nextprime(1+p)); (m); }; %o A346252 A346252(n) = A342001(A346102(n)); %o A346252 (PARI) %o A346252 A342002(n) = { my(s=0, m=1, p=2, e); while(n, e = (n%p); m *= p^(e>0); s += (e/p); n = n\p; p = nextprime(1+p)); (s*m); }; %o A346252 A346252(n) = A342002(A328622(n)); \\ Rest of program in A328622. %Y A346252 Cf. A003415, A003557, A276086, A328622, A342001, A342002, A346102. %Y A346252 Cf. also A344760, A346253. %K A346252 nonn,base,look %O A346252 0,3 %A A346252 _Antti Karttunen_, Jul 11 2021