Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A143427
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A143427 a(n)=least prime == -1 mod 6 such that q(n)*(q(n)+a(n))-1 is prime with q(i)=i-th prime == 1 mod 6. +0
4
5, 5, 11, 11, 5, 5, 11, 23, 5, 11, 17, 41, 23, 5, 11, 17, 29, 17, 17, 11, 47, 41, 11, 11, 41, 11, 29, 41, 5, 11, 29, 17, 11, 5, 47, 17, 17, 53, 11, 5, 17, 17, 47, 29, 11, 23, 11, 5, 17, 5, 17, 29, 11, 17, 29, 11, 17, 5, 11, 17, 5, 17, 17, 29, 17, 17, 5, 23, 23, 11, 113, 17, 113, 5 (list; graph; listen)
OFFSET

1,1

LINKS

Pierre CAMI, Table of n, a(n) for n = 1..10000

EXAMPLE

q(1)=7, 7*(7+5)-1=83 prime, 5 prime == -1 mod 6 so a(1)=5

q(2)=13, 13*(13+5)-1=233 prime, so a(2)=5

q(3)=19, 19*(19+5)-1=455 composite 19*(19+11)-1=569 prime, 11 prime == -1 mod 6 so a(3)=11

CROSSREFS

Cf. A143428, A143429, A143430.

Sequence in context: A151728 A130889 A058610 this_sequence A101203 A141244 A121849

Adjacent sequences: A143424 A143425 A143426 this_sequence A143428 A143429 A143430

KEYWORD

nonn

AUTHOR

Pierre CAMI (pierrecami(AT)tele2.fr), Aug 14 2008

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 November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research