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!)
A319042 Composite numbers k such that Pell(k) == 1 (mod k). 4

%I #9 Sep 11 2018 11:03:40

%S 35,169,385,899,961,1121,2001,3107,4879,4901,5719,6215,6265,6441,6479,

%T 6601,7055,7801,8119,8339,9799,10403,10763,10945,13079,13601,15841,

%U 18241,19097,20833,20951,22499,24727,27839,29183,29953,30731,31417,31535,34561,37345

%N Composite numbers k such that Pell(k) == 1 (mod k).

%C It appears that most of the terms of A319040 (Numbers k such that Pell(k) == 1 (mod k)) are primes; this sequence lists the composites.

%C For the composite numbers k such that Pell(k) == -1 (mod k), see A319043.

%H Seiichi Manyama, <a href="/A319042/b319042.txt">Table of n, a(n) for n = 1..500</a>

%e k=35 is in the sequence: Pell(35) = 8822750406821 = 35*252078583052 + 1 == 1 (mod 35).

%e k=6 is not in the sequence: Pell(6) = 70 = 6*12 - 2 !== 1 (mod 6).

%Y Cf. A000129 (Pell numbers), A094394, A319040, A319041, A319043.

%K nonn

%O 1,1

%A _Jon E. Schoenfield_, Sep 08 2018

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 13:27 EDT 2024. Contains 371971 sequences. (Running on oeis4.)