Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A108266
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A108266 Consider primes p and q such that p = 2^k + 15 and q = 2^(k+1) + 15 for some k; sequence gives values of p. +0
1
17, 19, 23, 31, 47, 1039, 2063, 32783, 4194319 (list; graph; listen)
OFFSET

0,1

COMMENT

It appears that these values are merely conjectures. - N. J. A. Sloane (njas(AT)research.att.com), Jun 30 2005

PROGRAM

(PARI) g(m, n, b) = { for(x=0, n, y=m+b^x+b%2; z=m+b^(x+1)+b%2; if(isprime(y)&isprime(z), print1(y", ") ) ) }

CROSSREFS

Sequence in context: A007635 A140947 A144487 this_sequence A102325 A038711 A154881

Adjacent sequences: A108263 A108264 A108265 this_sequence A108267 A108268 A108269

KEYWORD

nonn

AUTHOR

Cino Hilliard (hillcino368(AT)gmail.com), Jun 29 2005

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 19 21:04 EST 2009. Contains 171054 sequences.


AT&T Labs Research