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 Numbers k such that 2^(2*k-1) mod (2*k+1) = 2. 1

%I #13 Jun 27 2024 22:17:55

%S 1,4,7,10,16,19,25,28,31,34,43,46,55,61,64,70,79,88,91,97,100,106,109,

%T 118,124,133,145,151,154,157,160,163,169,190,196,199,205,208,223,226,

%U 235,244,250,259,268,271,286,289,295,298,316,334,340,343,346,349,358,361,365,376,385,394

%N Numbers k such that 2^(2*k-1) mod (2*k+1) = 2.

%H Harvey P. Dale, <a href="/A179209/b179209.txt">Table of n, a(n) for n = 1..1000</a>

%F { k : A178970(n) = 2 }.

%t Select[Range[400],PowerMod[2,2#-1,2#+1]==2&] (* _Harvey P. Dale_, Aug 16 2012 *)

%Y Cf. A000079, A178970, A179003.

%K nonn

%O 1,2

%A _Juri-Stepan Gerasimov_, Jan 05 2011

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 August 24 01:02 EDT 2024. Contains 375396 sequences. (Running on oeis4.)