login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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}. 3
42270067, 97579567, 340716433, 721933559, 890948323, 1726122269, 1865978047, 1889699677, 2362339121, 3185721853, 3637126963, 4668508603, 5064217117, 5569622789, 7480754459, 7701804269, 8594194301, 9005098303, 9180863669, 9939496717, 9979211051 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
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.
LINKS
Arkadiusz Wesolowski, Table of n, a(n) for n = 1..96
Chris Caldwell, The Prime Glossary, Riesel number
Carlos Rivera, Problem 29 and Problem 58
Index entries for linear recurrences with constant coefficients, signature (1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1).
FORMULA
a(n) = a(n-96) + 39832304070 for n > 96.
CROSSREFS
Subsequence of A101036.
A263562 gives the primes.
Sequence in context: A251306 A198168 A218109 * A213737 A254091 A254098
KEYWORD
nonn
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 19 02:55 EDT 2024. Contains 370952 sequences. (Running on oeis4.)