Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073881
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A073881 a(n) = smallest number m (obviously prime) such that pi(m) = 2*pi(n). +0
1
1, 3, 7, 7, 13, 13, 19, 19, 19, 19, 29, 29, 37, 37, 37, 37, 43, 43, 53, 53, 53, 53, 61, 61, 61, 61, 61, 61, 71, 71, 79, 79, 79, 79, 79, 79, 89, 89, 89, 89, 101, 101, 107, 107, 107, 107, 113, 113, 113, 113, 113, 113, 131, 131, 131, 131, 131, 131, 139, 139, 151, 151 (list; graph; listen)
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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research