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.

A263561 Odd numbers n such that for every k >= 1, n*2^k - 1 has a divisor in the set {3, 5, 13, 17, 97, 241, 257}.

Original entry on oeis.org

42270067, 97579567, 340716433, 721933559, 890948323, 1726122269, 1865978047, 1889699677, 2362339121, 3185721853, 3637126963, 4668508603, 5064217117, 5569622789, 7480754459, 7701804269, 8594194301, 9005098303, 9180863669, 9939496717, 9979211051
Offset: 1

Views

Author

Arkadiusz Wesolowski, Oct 21 2015

Keywords

Comments

What is the smallest term of this sequence that belongs to A076335? Is it the smallest Brier number?
This sequence contains only numbers of the form 30*k + 7, 30*k + 11, 30*k + 13, 30*k + 29.

Crossrefs

Subsequence of A101036.
A263562 gives the primes.

Formula

a(n) = a(n-96) + 39832304070 for n > 96.