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.

A326129 a(n) = gcd(A326127(n), A326128(n)).

Original entry on oeis.org

1, 1, 2, 1, 4, 0, 6, 1, 1, 2, 10, 1, 12, 4, 6, 1, 16, 1, 18, 1, 10, 8, 22, 6, 1, 10, 2, 21, 28, 12, 30, 1, 18, 14, 22, 1, 36, 16, 22, 10, 40, 12, 42, 1, 4, 20, 46, 1, 1, 1, 30, 3, 52, 12, 38, 2, 34, 26, 58, 3, 60, 28, 2, 1, 46, 12, 66, 1, 42, 4, 70, 1, 72, 34, 2, 3, 58, 12, 78, 1, 1, 38, 82, 7, 62, 40, 54, 2, 88, 2, 70, 1, 58, 44, 70, 30
Offset: 1

Views

Author

Antti Karttunen, Jun 09 2019

Keywords

Comments

Question: Are there any other numbers than those in A000396 that satisfy a(k) = A326128(k)?
See also comments in A336641, where all such k should reside. - Antti Karttunen, Jul 29 2020

Crossrefs

Programs

Formula

a(n) = n - A336645(n). - Antti Karttunen, Jul 29 2020