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!)
A130061 Numbers k such that k divides 3^((k-1)/2) - 2^((k-1)/2) - 1. 4

%I #8 Mar 26 2021 08:40:10

%S 1,3,35,147,195,219,291,399,579,583,723,939,1011,1023,1227,1299,1371,

%T 1443,1731,1803,2019,2307,2499,2811,3003,3027,3099,3387,3459,3603,

%U 3747,3891,3963,4467,4623,4827,4971,5187,5259,5331,5403,5619,5979,6051,6267

%N Numbers k such that k divides 3^((k-1)/2) - 2^((k-1)/2) - 1.

%C It appears that all terms are composite except a(1) = 1 and a(2) = 3. Most listed terms are divisible by 3, except {1, 35, 583, 70643, ...}.

%H Amiram Eldar, <a href="/A130061/b130061.txt">Table of n, a(n) for n = 1..10000</a>

%t Select[ Range[10000], Mod[ PowerMod[3,(#-1)/2,# ] - PowerMod[2,(#-1)/2,# ] -1, # ]==0&]

%Y Cf. A097934 (primes p that divide 3^((p-1)/2) - 2^((p-1)/2).

%Y Cf. A038876 (primes p such that 6 is a square mod p).

%Y Cf. A127071, A127072, A127073, A127074.

%Y Cf. A130058, A130059, A130060, A130062, A130063.

%K nonn

%O 1,2

%A _Alexander Adamchuk_, May 05 2007

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 29 19:38 EDT 2024. Contains 375518 sequences. (Running on oeis4.)