login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A090416 a(n) = if Floor[(2*Pi/E)*m] is prime then Floor[(2*Pi/E)*m] 0

%I #6 Mar 31 2024 17:07:09

%S 2,11,13,23,41,43,53,67,71,73,83,97,101,113,127,131,157,173,191,233,

%T 251,263,277,281,293,307,337,349,353,367,379,383,397,409,439,443,457,

%U 487,499,503,547,557,563,577,587,607,617,619,631,647,661,677,691,709,739

%N a(n) = if Floor[(2*Pi/E)*m] is prime then Floor[(2*Pi/E)*m]

%C Primes that behave like Shannon entropy power white noise with n=1.

%C Since (2*Pi/E) is a transcendental irrational, this function is a kind of irrational rotation related function, that is: Mod[(2*Pi/E)*n,1] is an irrational rotation and these numbers are Beatty in type such that: Beatty number+ irrational rotation =n Of my experiments in white noise entropy powers N=2 gives the most primes

%D C. E. Shannon, The Mathematical Theory of Communication, page 93

%t digits=5*200 f[n_]=Floor[(2*Pi/E)*n] a=Delete[Union[Table[If [PrimeQ[f[n]]==True, f[n], 0], {n, 1, digits}]], 1]

%t With[{c=(2*Pi)/E},Select[Table[Floor[c*n],{n,400}],PrimeQ]] (* _Harvey P. Dale_, Mar 31 2024 *)

%K nonn

%O 1,1

%A _Roger L. Bagula_, Jan 31 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)