cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A085917 Least k such that k*2^n - 1 is a semiprime.

Original entry on oeis.org

5, 4, 2, 1, 3, 5, 4, 2, 1, 2, 1, 3, 6, 3, 3, 3, 3, 6, 3, 3, 3, 2, 1, 3, 6, 3, 6, 3, 6, 3, 3, 11, 16, 8, 4, 2, 1, 8, 4, 2, 1, 15, 13, 15, 16, 8, 4, 2, 1, 6, 3, 17, 15, 12, 6, 3, 4, 2, 1, 3, 6, 3, 3, 5, 3, 2, 1, 5, 6, 3, 48, 24, 12, 6, 3, 12, 6, 3, 10, 5, 4, 2, 1, 3, 3, 31, 21, 17, 15, 11, 13, 24, 12, 6, 3
Offset: 1

Views

Author

Jason Earls, Aug 16 2003

Keywords

Comments

The first few values of n such that 509203*2^n - 1 is a semiprime, where k = 509203 (the conjectured smallest Riesel number), are: 3,4,16,34,61,82,124,142,163,171,... Conjecture: there are infinitely many semiprimes of this form.

Examples

			a(33)=16 because k*2^33 - 1 is not a semiprime for k=1,2,...15, but 16*2^33 - 1 = 223 * 616318177 is.
		

Crossrefs