# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a353574
Showing 1-1 of 1

%I A353574 #12 Apr 30 2022 22:51:19
%S A353574 1,1,5,1,7,1,7,2,31,13,41,1,9,11,37,2,47,1,11,7,43,19,53,1,13,17,49,
%T A353574 11,59,1,9,5,41,17,55,2,59,71,247,53,317,19,73,46,289,127,359,13,87,
%U A353574 113,331,74,401,11,101,67,373,169,443,1,11,13,47,5,61,17,69,43,277,121,347,2,83,107,319,71,389,31,97,16
%N A353574 a(n) = A342002(n) / gcd(A342002(n), A342002(A276154(n))).
%C A353574 Compare the scatter plot to that of A342002.
%H A353574 Antti Karttunen, <a href="/A353574/b353574.txt">Table of n, a(n) for n = 1..11550</a>
%H A353574 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H A353574 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A353574 a(n) = A342002(n) / A353573(n) = A342002(n) / gcd(A342002(n), A353572(n)).
%o A353574 (PARI)
%o A353574 A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
%o A353574 A003557(n) = (n/factorback(factorint(n)[, 1]));
%o A353574 A003961(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); }; \\ From A003961
%o A353574 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A353574 A342001(n) = (A003415(n) / A003557(n));
%o A353574 A353571(n) = A342001(A003961(n));
%o A353574 A353574(n) = { my(u=A342001(A276086(n))); u/gcd(u, A353571(A276086(n))); };
%Y A353574 Cf. A003415, A003557, A003961, A342001, A342002, A353572, A353573, A353575.
%K A353574 nonn,base,easy,look
%O A353574 1,3
%A A353574 _Antti Karttunen_, Apr 29 2022

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE