The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

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

%I

%S 2,83,113,1019,2221,4273,9467,13001,15923,19141,19991,34403,60661,

%T 62929,67589,74891,79967,82567,83443,86993,107843,109849,115979,

%U 117017,123341,151483,189067,197083,233743,242647,244147,254777,362473,384773,419473

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

%C N=n entropy power white noise as a prime sequence.

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

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

%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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 18 03:36 EDT 2021. Contains 347504 sequences. (Running on oeis4.)