login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A175905 Numbers n such that n = 4*(2*i+1)+1 and 2^(n-2) == 1 (mod (2*i+1)). 1
5, 29, 2045, 40133, 971837, 5063357, 7354397, 16554917, 17786525, 42244637, 52717277, 79704029, 84896957, 153424637, 262984997, 288644957, 328721213, 350252957, 353294757, 393411197, 498253253, 613578149, 634102757, 876046277 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Max Alekseyev, Table of n, a(n) for n = 1..79

MATHEMATICA

fQ[n_] := PowerMod[2, 8n + 3, 2n + 1] == 1; k = 1; lst = {5}; While[k < 10^9/8, If[ fQ@k, AppendTo[lst, 8k + 5]; Print[8k + 5]]; k++ ] (* Robert G. Wilson v, Oct 20 2010 *)

CROSSREFS

Sequence in context: A085553 A057208 A046842 * A057706 A057705 A237188

Adjacent sequences:  A175902 A175903 A175904 * A175906 A175907 A175908

KEYWORD

nonn

AUTHOR

Alzhekeyev Ascar M, Oct 12 2010

EXTENSIONS

a(13) onwards from Robert G. Wilson v, Oct 20 2010

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 31 22:45 EDT 2020. Contains 334756 sequences. (Running on oeis4.)