Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060235
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060235 Smallest primes whose residue modulo its difference from the next prime is 2n-1. +0
1
3, 7, 23, 199, 139, 467, 293, 1951, 1259, 2179, 3739, 3271, 12011, 45779, 18869, 14107, 62233, 27143, 34981, 44293, 102701, 25471, 91033, 117443, 107377, 445363, 181303, 153001, 399793, 195599, 273367, 531383, 537413, 633667, 302329, 576791 (list; graph; listen)
OFFSET

0,1

FORMULA

Min{p|Mod[p, nextprime(p)-p]=2n-1} a(n) is the least prime with Mod[A000040, A001223]=2n-1.

EXAMPLE

The residue Mod[p,d]=5=2.3-1 for primes {23,57,53,83,...} of which the first one is 23, so a(3)=23.

CROSSREFS

A000040, A001223.

Sequence in context: A048721 A113824 A121883 this_sequence A090188 A001773 A067604

Adjacent sequences: A060232 A060233 A060234 this_sequence A060236 A060237 A060238

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Mar 21 2001

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research