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.

A265859 Unluckiness of n.

Original entry on oeis.org

0, 1, 0, 1, 2, 1, 0, 1, 0, 1, 2, 1, 0, 1, 0, 1, 2, 1, 3, 1, 0, 1, 2, 1, 0, 1, 4, 1, 2, 1, 0, 1, 0, 1, 2, 1, 0, 1, 3, 1, 2, 1, 0, 1, 5, 1, 2, 1, 0, 1, 0, 1, 2, 1, 6, 1, 4, 1, 2, 1, 3, 1, 0, 1, 2, 1, 0, 1, 0, 1, 2, 1, 0, 1, 0, 1, 2, 1, 0, 1, 3, 1, 2, 1, 7, 1, 0
Offset: 1

Views

Author

Max Barrentine, Dec 17 2015

Keywords

Comments

If n is lucky, a(n)=0; if n is unlucky, a(n) is the step at which n is rejected from the lucky number sieve.

Crossrefs

Cf. also arrays A255543, A255545.
Cf. A271420 (analogous sequence).

Programs

Formula

a(n) = (1-A145649(n)) * A260438(n). - Antti Karttunen, Sep 11 2016, corrected Nov 15 2019