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.

A243050 Composite integers n such that n-1 divided by the binary period of 1/n (=A007733(n)) equals an integral power of 2.

Original entry on oeis.org

12801, 348161, 3225601, 104988673, 4294967297, 7816642561, 43796171521, 49413980161, 54745942917121, 51125767490519041, 18314818035992494081, 18446744073709551617
Offset: 1

Views

Author

Max Alekseyev, May 29 2014

Keywords

Comments

All terms are odd. If even n belongs to this sequence, then n-1 is odd and thus (n-1)/A007733(n) is also odd and thus must be equal to 1. On the other hand, for even n, A007733(n) < n/2 <= n-1, i.e., (n-1)/A007733(n) > 1, a contradiction.
Subsequence of A001567.
Contains all composite Fermat numbers A000215(k) = 2^(2^k)+1 (which are composite for 5<=k<=32 and conjecturally for any k>=5). In particular, a(5) = A000215(5), a(12) = A000215(6), and a(13) <= A000215(7) = 2^128+1.
Pseudoprimes n such that (n-1)/ord_{n}(2) = 2^k for some k, where ord_{n}(2) = A002326((n-1)/2) is the multiplicative order of 2 mod n. Composite numbers n such that Od(ord_{n}(2)) = Od(n-1), where ord_{n}(2) as above and Od(m) = A000265(m) is the odd part of m. Note that if Od(ord_{n}(2)) = Od(n-1), then ord_{n}(2)|(n-1). - Thomas Ordowski, Mar 13 2019

Examples

			n = a(6) = 7816642561 = 2^15 * 238545 + 1 is the first term, which is not Proth number (A080075). The binary period of 1/n is 954180 = (n-1)/2^13.
		

Crossrefs

Extensions

a(1)-a(3) from Lear Young; a(4)-a(5),a(9)-a(12) from Max Alekseyev; a(6),a(8) from Peter Kosinar; a(7) from Chris Boyd, May 29 2014.