Search a number
Pierpont primes
A prime of the form 1 + 2u ⋅ 3v. more

The Pierpont primes up to 1015 :

Distribution of the remainders when the numbers in this family are divided by n=2, 3,..., 11. (I took into account 114 values, from 2 to 578415690713089).

n\r 0  1 
21113 2 
311085 3 
40103110 4 
510413735 5 
601081104 6 
7101823252621 7 
8096160704 8 
90981172032 9 
100013701040035 10 
11001214118161514168

A pictorial representation of the table above
motab
Imagine to divide the members of this family by a number n and compute the remainders. Should they be uniformly distributed, each remainder from 0 to n-1 would be obtained in about (1/n)-th of the cases. This outcome is represented by a white square. Reddish (resp. bluish) squares represent remainders which appear more (resp. less) frequently than 1/n.