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.

A236373 Pseudoprimes to base 2 of the form 6p+1 such that 2^(p-1) == 1 (mod p).

Original entry on oeis.org

2047, 8388607, 140737488355327, 576460752303423487
Offset: 1

Views

Author

Alzhekeyev Ascar M, Jan 24 2014

Keywords

Comments

The first four terms are A065341(1), A065341(2), A065341(7), A065341(9) and have the form 2^m-1. Are there terms not of this form?
Composite 2^n-1 belong to this sequence when n is in A005385 (e.g., 2^83-1, 2^167-1, etc.)
No other terms below 2^64. - Max Alekseyev, May 28 2014

Examples

			2047=6*341+1; 2^2046 == 1 (mod 2047); 2^340 == 1 (mod 341).
		

Crossrefs

Subsequence of A001567.

Extensions

a(4) from Max Alekseyev, May 28 2014