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!)
A324646 a(n) = gcd(n, A276086(n-1)). 4

%I #6 Mar 11 2019 20:47:54

%S 1,2,3,2,1,6,1,2,3,10,1,6,1,2,15,2,1,18,1,10,3,2,1,6,25,2,3,2,1,30,1,

%T 2,3,2,7,18,1,2,3,10,1,42,1,2,15,2,1,6,7,50,3,2,1,18,5,14,3,2,1,30,1,

%U 2,21,2,1,6,1,2,3,70,1,18,1,2,75,2,7,6,1,10,3,2,1,42,5,2,3,2,1,90,7,2,3,2,1,6,1,98,3,10,1,6,1,2,105

%N a(n) = gcd(n, A276086(n-1)).

%H Antti Karttunen, <a href="/A324646/b324646.txt">Table of n, a(n) for n = 1..30030</a>

%H <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>

%H <a href="/index/Pri#primorial_numbers">Index entries for sequences related to primorial numbers</a>

%F a(n) = gcd(n, A276086(n-1)).

%F a(A002110(n)) = A002110(n) for all n >= 0.

%o (PARI)

%o A276086(n) = { my(i=0,m=1,pr=1,nextpr); while((n>0),i=i+1; nextpr = prime(i)*pr; if((n%nextpr),m*=(prime(i)^((n%nextpr)/pr));n-=(n%nextpr));pr=nextpr); m; };

%o A324646(n) = gcd(n,A276086(n-1));

%Y Cf. A002110, A276086, A324198, A324644.

%K nonn

%O 1,2

%A _Antti Karttunen_, Mar 11 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 24 15:52 EDT 2024. Contains 371961 sequences. (Running on oeis4.)