Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A138066
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A138066 Least k>0 such that (2n-1)^k + 2 is prime, or 0 if no such number exists. +0
2
1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 11, 0, 1, 1, 0, 2, 1, 0, 1, 1, 0, 1, 113, 0, 1, 7, 0, 1, 1, 0, 3, 1, 0, 1, 1, 0, 12, 1, 0, 1, 3, 0, 1, 255, 0, 8, 1, 0, 1, 1, 0, 1, 1, 0, 1, 3, 0, 2, 15, 0, 2, 1, 0, 1, 23, 0, 1, 1, 0, 4, 3, 0, 1, 1, 0, 3, 1, 0, 136, 1, 0, 1 (list; graph; listen)
OFFSET

1,12

COMMENT

a(3n+1) = 0 for n>0.

a(84) is currently unknown.

CROSSREFS

Cf. A084713 = Smallest prime of the form (2n-1)^k + 2, or 0 if no such number exists. Cf. A138067 = Least k>1 such that (2n-1)^k + 2 is prime, or 0 if no such number exists. Cf. A051783 = Numbers n such that 3^n + 2 is prime. Cf. A087885 = Numbers n such that 5^n + 2 is prime. Cf. A090649, A109076, A113480, A138048, A138049, A138050, A138051, A087886, A113481.

Sequence in context: A131679 A113043 A110408 this_sequence A115595 A003621 A055963

Adjacent sequences: A138063 A138064 A138065 this_sequence A138067 A138068 A138069

KEYWORD

hard,more,nonn

AUTHOR

Alexander Adamchuk (alex(AT)kolmogorov.com), Mar 02 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 23 10:40 EST 2009. Contains 167421 sequences.


AT&T Labs Research