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.

A340078 a(n) = gcd(n, 1+A018804(n)), where A018804(n) = Sum_{k=1..n} gcd(k, n).

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Dec 30 2020

Keywords

Crossrefs

Cf. also A055023, A323071 (similar but different sequences).

Programs

Formula

a(n) = gcd(n, 1+A018804(n)).

A340080 a(n) = (1+A018804(n)) / gcd(n, 1+A018804(n)), where A018804(n) = Sum_{k=1..n} gcd(k, n).

Original entry on oeis.org

2, 2, 2, 9, 2, 8, 2, 21, 22, 14, 2, 41, 2, 20, 46, 49, 2, 32, 2, 73, 22, 32, 2, 101, 66, 38, 82, 15, 2, 68, 2, 113, 106, 50, 118, 169, 2, 56, 42, 181, 2, 14, 2, 169, 38, 68, 2, 241, 134, 98, 166, 201, 2, 122, 38, 261, 62, 86, 2, 361, 2, 92, 274, 257, 226, 158, 2, 265, 226, 176, 2, 421, 2, 110, 326, 297, 274, 188
Offset: 1

Views

Author

Antti Karttunen, Dec 31 2020

Keywords

Crossrefs

Programs

Formula

a(n) = (1+A018804(n)) / gcd(n, 1+A018804(n)).
Showing 1-2 of 2 results.