Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A074497
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A074497 a(n) = the smallest prime > Pi^n. +0
3
5, 11, 37, 101, 307, 967, 3023, 9491, 29819, 93683, 294211, 924281, 2903689, 9122207, 28658153, 90032231, 282844571, 888582407, 2791563953, 8769956803, 27551631847, 86556004201, 271923706939, 854273519929, 2683779414353 (list; graph; listen)
OFFSET

1,1

EXAMPLE

The first prime > Pi^3= 31.006.... is 37, so a(3) = 37.

MATHEMATICA

p[n_] := Module[{r, i}, r = 2; i = 1; While[r <= n, i = i + 1; r = Prime[i]]; r]; Table[p[Pi^n], {n, 1, 10}]

PROGRAM

(PARI) with \p1000: for(n=1, 30, print1(nextprime(Pi^n)", "))

CROSSREFS

Sequence in context: A065315 A065317 A152563 this_sequence A077466 A074626 A090186

Adjacent sequences: A074494 A074495 A074496 this_sequence A074498 A074499 A074500

KEYWORD

easy,nonn

AUTHOR

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Sep 26 2002

EXTENSIONS

More terms from Ralf Stephan (ralf(AT)ark.in-berlin.de), Mar 19 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 3 22:15 EST 2009. Contains 170310 sequences.


AT&T Labs Research