login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A328323 a(n) = gcd(A328316(n),A328316(1+n)). 5
1, 1, 1, 3, 1, 1, 1, 1, 2401, 861018571670257 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

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

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

LINKS

Antti Karttunen, Table of n, a(n) for n = 0..10

FORMULA

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

PROG

(PARI)

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

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

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

\\ Or alternatively, as:

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

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

CROSSREFS

Cf. A276086, A324198, A328316, A328317.

Sequence in context: A200473 A180172 A327372 * A090751 A322127 A282496

Adjacent sequences:  A328320 A328321 A328322 * A328324 A328325 A328326

KEYWORD

nonn

AUTHOR

Antti Karttunen, Oct 14 2019

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 6 07:52 EDT 2020. Contains 333267 sequences. (Running on oeis4.)