|
| |
|
|
A090417
|
|
Primes of the form floor(2*Pi*n/(e*log(n))).
|
|
1
| |
|
|
7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| An entropy power of white noise function with N=1/log(n).
Function is based on asymptotic form of distribution: PrimePi[n]--> n/log(n) Function misses the first three primes {2,3,5}, but is pretty good after that.
It is easy to see due to the slow growth of the function that the sequence is precisely the primes greater than 5. [Charles R Greathouse IV, Aug 21 2011]
|
|
|
REFERENCES
| C. E. Shannon, The Mathematical Theory of Communication, page 93
|
|
|
MATHEMATICA
| digits=5*200 f[n_]=Floor[2*Pi*n/(E*Log[n])] a=Delete[Union[Table[If [PrimeQ[f[n]]==True, f[n], 0], {n, 2, digits}]], 1]
|
|
|
PROG
| (PARI) a(n)=prime(n+3) \\ Charles R Greathouse IV, Aug 21 2011
|
|
|
CROSSREFS
| Sequence in context: A070884 A135777 A090459 * A020631 A020637 A020633
Adjacent sequences: A090414 A090415 A090416 * A090418 A090419 A090420
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jan 31 2004
|
| |
|
|
