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.

A145532 Number of numbers removed in each step of Eratosthenes's sieve for 5!.

Original entry on oeis.org

59, 19, 7, 4
Offset: 1

Views

Author

Artur Jasinski, Oct 12 2008

Keywords

Comments

The number of steps in Eratosthenes's sieve for n! is A133228(n).
The number of primes less than 5! is 120 - 59 - 19 - 7 - 4 - 1 = 30 = A003604(5).

Examples

			a(1)=59 because in first step we removed all numbers divisible by 2 (=60) with the exception of the first one, i.e., 2.
a(2)=19 because the number of numbers divisible by 3 and not divisible by 2 is 20 and we remove all with the exception of the first one, i.e., 3.
		

Crossrefs