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!)
A179458 Numbers n such that ((2^(2n) - 1) mod 2n) - (2^(2n-1) mod 2n) = 1. 1
1, 3, 5, 7, 11, 13, 15, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 85, 89, 91, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Apparently, the sequence contains 1, odd primes and the elements of A020136. - R. J. Mathar, Jan 09 2011
LINKS
FORMULA
A082495(2*a(n)) - A062173(2*(a*(n))=1.
MAPLE
select(n -> (2 &^ (2*n)-1 mod 2*n)-(2 &^(2*n-1) mod 2*n) = 1, [$1..1000]); # Robert Israel, Oct 25 2017
PROG
(PARI) isok(n) = (((2^(2*n)-1) % (2*n)) - (2^(2*n-1) % (2*n)) == 1) \\ Michel Marcus, Jul 25 2013
CROSSREFS
Cf. A001567.
Sequence in context: A359260 A294674 A340077 * A062086 A283680 A005239
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 May 4 21:18 EDT 2024. Contains 372257 sequences. (Running on oeis4.)