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

 


a(n) = gcd(A328316(n),A328316(1+n)).
5

%I #10 Oct 14 2019 13:56:12

%S 1,1,1,3,1,1,1,1,2401,861018571670257

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

%C All terms are odd, because the parity of A328316 alternates.

%C a(10) is 208 decimal digits long, and can be found in the b-file.

%H Antti Karttunen, <a href="/A328323/b328323.txt">Table of n, a(n) for n = 0..10</a>

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

%o (PARI)

%o A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };

%o A328316(n) = if(!n,0,A276086(A328316(n-1)));

%o A328323(n) = gcd(A328316(n),A328316(1+n));

%o \\ Or alternatively, as:

%o A324198(n) = gcd(n, A276086(n));

%o A328323(n) = A324198(A328316(n));

%Y Cf. A276086, A324198, A328316, A328317.

%K nonn

%O 0,4

%A _Antti Karttunen_, Oct 14 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 23 04:06 EDT 2024. Contains 376142 sequences. (Running on oeis4.)