Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A145532
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A145532 a(n)=number of numbers removed in each step of Eratosthenes' sieve for 5! +0
20
59, 19, 7, 4 (list; graph; listen)
OFFSET

1,1

COMMENT

Number of steps in Eratosthenes' sieve for n! is A133228(n).

Number of primes less than 5! is equal = 120-59-19-7-4-1 = 30 = A003604(5).

EXAMPLE

a(1)=59 because in first step we removed all numbers divisible by 2 (=60) with exception first one number 2.

a(2)=19 because number of numbers divisible by 3 and not divisible by 2 is 20 and we remove all with exception first one number 3.

CROSSREFS

A003604, A133228, A145532-A145540

Sequence in context: A051321 A088665 A159250 this_sequence A152214 A033379 A122252

Adjacent sequences: A145529 A145530 A145531 this_sequence A145533 A145534 A145535

KEYWORD

fini,nonn

AUTHOR

Artur Jasinski (grafix(AT)csl.pl), Oct 12 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research