The OEIS is supported by the many generous donors to the OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A211672 Least number k such that the polynomial x^n - x^(n-1) -...- 1 (mod k) has more than n distinct zeros. 1

%I #5 Mar 13 2015 23:50:12

%S 209,517,3973,1081,1285,2893,13501,38579,105113,4897,12331

%N Least number k such that the polynomial x^n - x^(n-1) -...- 1 (mod k) has more than n distinct zeros.

%C This is the characteristic polynomial of the n-step Fibonacci and Lucas sequences. These terms produce the following number of distinct zeros: 4, 6, 8, 6, 8, 8, 10, 12, 15, 12, 18. The first 11 terms are semiprimes; the 12th term has 3 factors. For prime k, the polynomial can have at most n zeros.

%t Clear[x]; Table[poly = x^n - Sum[x^k, {k, 0, n - 1}]; k = 1; While[cnt = 0; Do[If[Mod[poly, k] == 0, cnt++], {x, 0, k-1}]; cnt <= n, k++]; k, {n, 2, 7}]

%Y Cf. A211671 (for prime k).

%K nonn,hard,more

%O 2,1

%A _T. D. Noe_, Apr 19 2012

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.

Last modified September 26 21:54 EDT 2023. Contains 365668 sequences. (Running on oeis4.)