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!)
A179209 n such that 2^(2n-1) mod (2n+1) = 2. 1
1, 4, 7, 10, 16, 19, 25, 28, 31, 34, 43, 46, 55, 61, 64, 70, 79, 88, 91, 97, 100, 106, 109, 118, 124, 133, 145, 151, 154, 157, 160, 163, 169, 190, 196, 199, 205, 208, 223, 226, 235, 244, 250, 259, 268, 271, 286, 289, 295, 298, 316, 334, 340, 343, 346, 349, 358, 361, 365, 376, 385, 394 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
{n: A178970(n)=2}.
MATHEMATICA
Select[Range[400], PowerMod[2, 2#-1, 2#+1]==2&] (* Harvey P. Dale, Aug 16 2012 *)
CROSSREFS
Sequence in context: A138694 A359274 A177965 * A168565 A310711 A115288
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 April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)