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.

A076918 a(1) = 1, a(n+1) = A076271(n+1) divided by the highest common factor of A076271(n) and A076271(n+1).

Original entry on oeis.org

1, 2, 2, 3, 3, 4, 5, 4, 5, 6, 7, 6, 7, 8, 9, 10, 11, 8, 9, 10, 11, 12, 13, 12, 13, 14, 15, 16, 17, 14, 15, 16, 17, 18, 19, 18, 19, 20, 21, 22, 23, 20
Offset: 1

Views

Author

Amarnath Murthy, Oct 17 2002

Keywords

Comments

If a(k) is the first occurrence of a prime p(r), the r-th prime then a(k+1) = p(r-1) + 1,... a(k+m) = p(r-1) + m until a(k + p(r)-p(r-1))= p(r) again.( the second and the last occurrence of p(r)).

Crossrefs

Cf. A076271.