login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A263500 Smallest positive b such that for all k >= 1 the numbers n*b^k + 1 are composite and gcd(n+1, b-1) = 1, or 0 if n > 1 is of the form 2^m - 1. 0
0, 14, 140324348, 34, 0, 8, 177744, 32, 14 (list; graph; refs; listen; history; text; internal format)
OFFSET

3,2

COMMENTS

a(2) = 131072, or it is a Sierpiński number multiplied by a power of 2.

Because a(1) = 8 but a(2) is unknown, we do not include it here; we set the offset to 3.

a(2) <= 201446503145165177.

LINKS

Table of n, a(n) for n=3..11.

Dan Krywaruczenko, A Reverse Sierpiński Number Problem

CROSSREFS

Cf. A123159.

Sequence in context: A013800 A013870 A195898 * A164526 A278897 A123652

Adjacent sequences:  A263497 A263498 A263499 * A263501 A263502 A263503

KEYWORD

nonn,more,hard

AUTHOR

Arkadiusz Wesolowski, Oct 19 2015

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 November 17 05:27 EST 2019. Contains 329217 sequences. (Running on oeis4.)