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.

A256488 a(n) = A256487(n)/2 = (A254100(n) - A219178(n))/2.

Original entry on oeis.org

1, 2, 0, 2, 5, 9, 8, 18, 14, 24, 39, 40, 31, 45, 38, 55, 67, 79, 100, 110, 112, 108, 118, 140, 154, 156, 131, 157, 164, 201, 215, 212, 219, 244, 253, 269, 207, 255, 321, 310, 340, 324, 328, 345, 333, 342, 365, 395, 371, 420, 422, 431, 458, 488, 502, 546, 536, 556, 527, 583, 588, 592, 646, 643, 639, 665, 688, 662, 662
Offset: 1

Views

Author

Antti Karttunen, May 01 2015

Keywords

Comments

Half the difference between the least nonludic number removed at the n-th stage of Ludic sieve and the least unlucky number removed at the n-th stage of Lucky sieve.

Crossrefs

Programs

Formula

a(n) = A256487(n)/2 = (A254100(n) - A219178(n))/2.