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!)
A175530 Pseudoprime Chebyshev numbers: odd composite integers n such that T_n(a) == a (mod n) for all integers a, where T(x) is Chebyshev polynomial of first kind. 6

%I #34 Jun 15 2021 07:31:21

%S 7056721,79397009999,443372888629441,582920080863121,2491924062668039,

%T 14522256850701599,39671149333495681,242208715337316001,

%U 729921147126771599,842526563598720001,1881405190466524799,2380296518909971201,3188618003602886401,33711266676317630401,54764632857801026161,55470688965343048319,72631455338727028799,122762671289519184001,361266866679292635601,734097107648270852639

%N Pseudoprime Chebyshev numbers: odd composite integers n such that T_n(a) == a (mod n) for all integers a, where T(x) is Chebyshev polynomial of first kind.

%C Odd composite integer n is a pseudoprime Chebyshev number iff the n-th term of Lucas sequence satisfies the congruence V_n(P,1) == P (mod n) for any integer P.

%C Odd composite integer n is a pseudoprime Chebyshev number iff n == +1 or -1 (mod p-1) and n == +1 or -1 (mod p+1) for each prime p|n.

%C No other terms below 10^21.

%C Named after the Russian mathematician Pafnuty Chebyshev (1821-1894) after whom the "Chebyshev polynomials" were also named. - _Amiram Eldar_, Jun 15 2021

%H David Broadhurst, <a href="https://listserv.nodak.edu/cgi-bin/wa.exe?A2=NMBRTHRY;1d24d4ee.1006">The second Chebyshev number</a>, NMBRTHRY Mailing List, 4 June 2010.

%H Kok Seng Chua, <a href="https://arxiv.org/abs/2010.02677">Chebyshev polynomials and higher order Lucas Lehmer algorithm</a>, arXiv:2010.02677 [math.NT], 2020. Mentions this sequence.

%H David Pokrass Jacobs, Mohamed O. Rayes, and Vilmar Trevisan, <a href="http://mi.mathnet.ru/eng/adm159">Characterization of Chebyshev Numbers</a>, Algebra and Discrete Mathematics, Vol. 2 (2008), pp. 65-82.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/LucasSequence.html">Lucas Sequence</a>.

%e 7056721 = 7 * 47 * 89 * 241, while 7056721 == 1 (mod 7-1), == 1 (mod 7+1), == -1 (mod 47-1), == 1 (mod 47+1), == 1 (mod 89-1), == 1 (mod 89+1), == 1 (mod 241-1), and == 1 (mod 241+1).

%Y Terms that are Carmichael numbers (A002997) form A299799.

%Y Contains A175531 as a subsequence.

%Y Cf. A053120

%K hard,nonn

%O 1,1

%A _Max Alekseyev_, Jun 08 2010

%E a(1) is given in the Jacobs-Rayes-Trevisan paper.

%E a(2) from Kevin Acres, David Broadhurst, Ray Chandler, David Cleaver, Mike Oakes, and Christ van Willegen, Jun 04 2010

%E a(3)-a(20) from _Max Alekseyev_, Jun 08 2010, Feb 26 2018, Dec 16 2020

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 19 16:52 EDT 2024. Contains 371794 sequences. (Running on oeis4.)