login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A373368 a(n) = gcd(n, A059975(n)), where A059975 is fully additive with a(p) = p-1. 6

%I #9 Jun 05 2024 14:49:48

%S 1,1,1,2,1,3,1,1,1,5,1,4,1,7,3,4,1,1,1,2,1,11,1,1,1,13,3,4,1,1,1,1,3,

%T 17,5,6,1,19,1,1,1,3,1,4,1,23,1,6,1,1,3,2,1,1,1,1,1,29,1,4,1,31,1,2,1,

%U 1,1,2,3,1,1,1,1,37,5,4,1,3,1,8,1,41,1,2,5,43,3,1,1,9,1,4,1,47,1,1,1,1,1,10

%N a(n) = gcd(n, A059975(n)), where A059975 is fully additive with a(p) = p-1.

%H Antti Karttunen, <a href="/A373368/b373368.txt">Table of n, a(n) for n = 1..65537</a>

%o (PARI)

%o A059975(n) = {my(f = factor(n)); sum(i = 1, #f~, f[i, 2]*(f[i, 1] - 1)); };

%o A373368(n) = gcd(n, A059975(n));

%Y Cf. A059975, A108269 (positions of even terms), A359794 (of odd terms), A359832 (parity of terms).

%Y Cf. also A082299, A373361, A373369.

%K nonn

%O 1,4

%A _Antti Karttunen_, Jun 05 2024

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 29 17:26 EDT 2024. Contains 373855 sequences. (Running on oeis4.)