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!)
A324046 a(n) = gcd(n, A106316(n)). 5

%I #6 Feb 14 2019 07:47:03

%S 1,1,1,1,1,6,1,2,1,2,1,4,1,2,3,2,1,6,1,4,1,2,1,12,1,2,1,28,1,6,1,1,3,

%T 2,1,3,1,2,1,10,1,6,1,4,9,2,1,12,1,1,3,2,1,18,1,8,1,2,1,12,1,2,3,1,1,

%U 6,1,2,3,2,1,12,1,2,3,4,1,6,1,8,3,2,1,28,1,2,3,4,1,18,7,4,1,2,5,48,1,1,9,4,1,6,1,2,3

%N a(n) = gcd(n, A106316(n)).

%H Antti Karttunen, <a href="/A324046/b324046.txt">Table of n, a(n) for n = 1..20000</a>

%F a(n) = gcd(n, A106316(n)).

%o (PARI)

%o A106315(n) = (n*numdiv(n) % sigma(n));

%o A106316(n) = (A106315(n) % n);

%o A324046(n) = gcd(n,A106316(n));

%Y Cf. A000005, A000203, A106315, A106316, A324045, A324047.

%K nonn

%O 1,6

%A _Antti Karttunen_, Feb 13 2019

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 April 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)