Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A113213
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A113213 Smallest number m such that 2^n +/- m are primes. +0
2
0, 1, 3, 3, 9, 3, 21, 15, 9, 15, 21, 3, 45, 135, 75, 15, 99, 93, 99, 315, 105, 105, 15, 75, 339, 117, 261, 183, 351, 453, 1281, 267, 675, 867, 819, 117, 69, 2343, 1995, 1005, 2949, 165, 741, 603, 315, 1287, 1629, 243, 519, 765, 165, 1233, 741, 1797, 339, 177 (list; graph; listen)
OFFSET

1,3

COMMENT

At n>=3 all terms are multiples of 3.

EXAMPLE

a(1)=0 because 2^1 +/- 0 are primes; a(2)=1 because 2^2 -/+ 1 are primes;

a(33)=675 because 2^33 +/- 675 are closest (to each other) primes.

CROSSREFS

Sequence in context: A166466 A068219 A157031 this_sequence A088032 A066572 A104195

Adjacent sequences: A113210 A113211 A113212 this_sequence A113214 A113215 A113216

KEYWORD

nonn

AUTHOR

Zak Seidov (zakseidov(AT)yahoo.com), Jan 07 2006

page 1

Search completed in 0.005 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