cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A067559 Numbers n such that floor(Pi*n^2) is prime.

This page as a plain text file.
%I A067559 #11 May 22 2017 11:44:36
%S A067559 1,6,17,31,34,41,45,50,51,61,69,73,74,81,103,108,111,142,148,175,192,
%T A067559 201,202,203,232,234,273,277,281,310,319,329,342,348,349,351,378,387,
%U A067559 416,421,428,435,459,478,486,521,526,575,593,597,603,605,623,648,661
%N A067559 Numbers n such that floor(Pi*n^2) is prime.
%H A067559 Vincenzo Librandi, <a href="/A067559/b067559.txt">Table of n, a(n) for n = 1..1000</a>
%e A067559 Floor[Pi*6^2] = 113, a prime, so 6 is a term of the sequence.
%t A067559 Select[Range[1, 10^3], PrimeQ[Floor[Pi * #^2]] &]
%o A067559 (PARI) is(n)=isprime(floor(Pi*n^2)) \\ _Charles R Greathouse IV_, May 22 2017
%Y A067559 Cf. A062408.
%K A067559 easy,nonn
%O A067559 1,2
%A A067559 _Joseph L. Pe_, Jan 29 2002