Function Repository Resource:

# LuckyNumbers

Get a list of lucky numbers

Contributed by: Enrique Zeleny
 ResourceFunction["LuckyNumbers"][n] gives the lucky numbers until integer n. ResourceFunction["LuckyNumbers"][n,k] gives the lucky numbers until integer n, only iterating the sieve procedure k times.

## Details and Options

Lucky numbers are defined through a sieving procedure: Start with the odd integers and strike out every third number. This gets rid of 5, 11, 17, 23 and so on. The third surviving number from the left is 7, so strike out every seventh integer not yet eliminated: 19, 39, .... The integers that survive are the lucky numbers.
Lucky numbers seem to share many properties with primes.

## Examples

### Basic Examples

First lucky numbers before 100:

 In[1]:=
 Out[1]=

Lucky numbers that are primes are lucky primes:

 In[2]:=
 Out[2]=

The first 300 integers surviving 6 steps of the lucky sieve process:

 In[3]:=
 Out[3]=

Step-by-step sieve for lucky numbers:

 In[4]:=
 Out[4]=
 In[5]:=

Distance between lucky numbers:

 In[6]:=
 Out[6]=

Highlight lucky numbers in an array:

 In[7]:=
 Out[7]=

Comparing with prime numbers:

 In[8]:=
 Out[8]=

“Twin” lucky numbers (those separated by an even number):

 In[9]:=
 Out[9]=

Goldbach conjecture for luckies (an even number is a sum of two luckies):

 In[10]:=
 Out[10]=

Number of lucky numbers less than a million:

 In[11]:=
 Out[11]=

## Requirements

Wolfram Language 11.3 (March 2018) or above