cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A345941 a(n) = gcd(n, A329044(n)).

Original entry on oeis.org

1, 2, 3, 4, 5, 3, 7, 2, 3, 5, 11, 3, 13, 7, 5, 4, 17, 9, 19, 5, 7, 11, 23, 3, 25, 13, 3, 7, 29, 5, 31, 2, 11, 17, 7, 9, 37, 19, 13, 5, 41, 7, 43, 11, 5, 23, 47, 3, 7, 25, 17, 13, 53, 9, 11, 7, 19, 29, 59, 5, 61, 31, 7, 4, 13, 11, 67, 17, 23, 7, 71, 9, 73, 37, 25, 19, 11, 13, 79, 5, 3, 41, 83, 7, 17, 43, 29, 11, 89
Offset: 1

Views

Author

Antti Karttunen, Jul 03 2021

Keywords

Comments

Only powers of primes (A000961) occur as terms. A346087 gives the exponents. - Antti Karttunen, Jul 07 2021

Crossrefs

Programs

Formula

a(n) = gcd(n, A329044(n)).
a(n) = n / A345942(n).
a(n) = A329044(n) / A345943(n).
a(p) = p for all primes p.
From Antti Karttunen, Jul 07 2021: (Start)
a(n) = A006530(n)^A346087(n) = A006530(n)^min(A071178(n), A329348(n)).
a(n) = gcd(n, A346097(n)).
A006530(a(n)) = A020639(A329044(n)) = A006530(n).
(End)

A345943 a(n) = A329044(n) / gcd(n, A329044(n)).

Original entry on oeis.org

1, 1, 1, 1, 1, 3, 1, 3, 5, 5, 1, 27, 1, 7, 3125, 9, 1, 25, 1, 125, 16807, 11, 1, 45, 2401, 13, 7, 343, 1, 4375, 1, 5, 161051, 17, 99648703, 5625, 1, 19, 371293, 7, 1, 11, 1, 1331, 16807, 23, 1, 125, 23030293, 144120025, 1419857, 2197, 1, 49, 224939, 823543, 2476099, 29, 1, 8575, 1, 31, 65219, 25, 396067447082177, 285311670611
Offset: 1

Views

Author

Antti Karttunen, Jul 04 2021

Keywords

Crossrefs

Programs

Formula

a(n) = A329044(n) / A345941(n) = A329044(n) / gcd(n, A329044(n)).
Showing 1-2 of 2 results.