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.

A200810 Iterate k -> d(k) until an odd prime is reached.

Original entry on oeis.org

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

Views

Author

Keywords

Comments

Csajbók and Kasza call this "lasttau(n)". Imre Kátai asks for its asymptotic behavior.

Crossrefs

Programs

A200811 Iterate k -> d(k) until an odd prime is reached, starting from the n-th composite.

Original entry on oeis.org

3, 3, 3, 3, 3, 3, 3, 3, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3
Offset: 1

Views

Author

Keywords

Comments

a(n) is not 3 for n in {9, 45, 58, 89, 128, 163, 168, ...}.

Crossrefs

Showing 1-2 of 2 results.