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!)
A323071 a(n) = gcd(n, 1+A060681(n)). 5

%I #10 Jan 05 2019 08:20:43

%S 1,2,3,1,5,2,7,1,1,2,11,1,13,2,1,1,17,2,19,1,3,2,23,1,1,2,1,1,29,2,31,

%T 1,1,2,1,1,37,2,3,1,41,2,43,1,1,2,47,1,1,2,1,1,53,2,5,1,3,2,59,1,61,2,

%U 1,1,1,2,67,1,1,2,71,1,73,2,3,1,1,2,79,1,1,2,83,1,1,2,1,1,89,2,1,1,3,2,1,1,97,2,1,1,101,2,103,1,1

%N a(n) = gcd(n, 1+A060681(n)).

%C Differs from A055023 at n = 55, 105, 155, ..., (A323070).

%H Antti Karttunen, <a href="/A323071/b323071.txt">Table of n, a(n) for n = 1..16384</a>

%H Antti Karttunen, <a href="/A323071/a323071.txt">Data supplement: n, a(n) computed for n = 1..100000</a>

%F a(n) = gcd(n, 1+A060681(n)).

%F a(n) = n/A323072(n).

%o (PARI)

%o A060681(n) = (n-if(1==n,n,n/vecmin(factor(n)[,1])));

%o A323071(n) = gcd(n,1+A060681(n));

%Y Cf. A055023, A060681, A323070, A323072.

%K nonn

%O 1,2

%A _Antti Karttunen_, Jan 04 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 19 18:05 EDT 2024. Contains 371798 sequences. (Running on oeis4.)