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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A234372 Second smallest prime congruent to 1 modulo n-th prime. 2
5, 13, 31, 43, 67, 79, 137, 229, 139, 233, 373, 223, 739, 431, 659, 743, 827, 733, 1609, 853, 439, 1423, 499, 1069, 971, 809, 1031, 857, 2399, 1583, 2287, 787, 1097, 1669, 1789, 1511, 3769, 2609, 5011, 1039, 1433, 1811, 2293, 1931, 4729, 2389, 4643, 6691, 5903, 5039, 1399, 1913, 2411, 4519, 9767, 5261, 3229, 2711 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

a(10^k) for k=1..10: 233, 11903, 142543, 837833, 36391853, 247773809, 3947342807, 146741381497, 684052904671, 16638454841119.

LINKS

Zak Seidov, Table of n, a(n) for n = 1..1000

EXAMPLE

a(3) = 31 because prime(3) = 5, first prime == 1 mod 5 is 11 and 2nd one is 31.

a(4) = 43 because prime(4) = 7, first prime == 1 mod 7 is 29 and 2nd one is 43.

MATHEMATICA

Table[If[n<2, 5, p=Prime[n]; r=1+2*p; While[!PrimeQ[r], r+=2*p]; r+=2*p; While[!PrimeQ[r], r+=2*p]; r],  {n, 100}]

CROSSREFS

Cf. A035095.

Sequence in context: A256314 A002768 A086522 * A102725 A271997 A332368

Adjacent sequences:  A234369 A234370 A234371 * A234373 A234374 A234375

KEYWORD

nonn

AUTHOR

Zak Seidov, Dec 25 2013

STATUS

approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 23 20:42 EDT 2021. Contains 347617 sequences. (Running on oeis4.)