cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A106273 Discriminant of the polynomial x^n - x^(n-1) - ... - x - 1.

Original entry on oeis.org

1, 5, -44, -563, 9584, 205937, -5390272, -167398247, 6042477824, 249317139869, -11597205023744, -601139006326619, 34383289858207744, 2151954708695291177, -146323302326154543104, -10742330662077208945103, 846940331265064719417344, 71373256668946058057974997
Offset: 1

Views

Author

T. D. Noe, May 02 2005

Keywords

Comments

This polynomial is the characteristic polynomial of the Fibonacci and Lucas n-step sequences. These discriminants are prime for n=2, 4, 6, 26, 158 (A106274). It appears that the term a(2n+1) always has a factor of 2^(2n). With that factor removed, the discriminants are prime for odd n=3, 5, 7, 21, 99, 405. See A106275 for the combined list.
a(n) is the determinant of an r X r Hankel matrix whose entries are w(i+j) where w(n) = x1^n + x2^n + ... + xr^n where x1,x2,...xr are the roots of the titular characteristic polynomial. E.g., A000032 for n=2, A001644 for n=3, A073817 for n=4, A074048 for n=5, A074584 for n=6, A104621 for n=7, ... - Kai Wang, Jan 17 2021
Luca proves that a(n) is a term of the corresponding k-nacci sequence only for n=2 and 3. - Michel Marcus, Apr 12 2025

Crossrefs

Cf. A086797 (discriminant of the polynomial x^n-x-1), A000045, A000073, A000078, A001591, A001592 (Fibonacci n-step sequences), A000032, A001644, A073817, A074048, A074584, A104621, A105754, A105755 (Lucas n-step sequences), A086937, A106276, A106277, A106278 (number of distinct zeros of these polynomials for n=2, 3, 4, 5).

Programs

  • Mathematica
    Discriminant[p_?PolynomialQ, x_] := With[{n=Exponent[p, x]}, Cancel[((-1)^(n(n-1)/2) Resultant[p, D[p, x], x])/Coefficient[p, x, n]^(2n-1)]]; Table[Discriminant[x^n-Sum[x^i, {i, 0, n-1}], x], {n, 20}]
  • PARI
    {a(n)=(-1)^(n*(n+1)/2)*((n+1)^(n+1)-2*(2*n)^n)/(n-1)^2}  \\ Max Alekseyev, May 05 2005
    
  • PARI
    a(n)=poldisc('x^n-sum(k=0,n-1,'x^k)); \\ Joerg Arndt, May 04 2013

Formula

a(n) = (-1)^(n*(n+1)/2) * ((n+1)^(n+1)-2*(2*n)^n)/(n-1)^2. - Max Alekseyev, May 05 2005

A106281 Primes p such that the polynomial x^5-x^4-x^3-x^2-x-1 mod p has 5 distinct zeros.

Original entry on oeis.org

691, 733, 3163, 4259, 4397, 5419, 6637, 6733, 8009, 8311, 9803, 11731, 14923, 17291, 20627, 20873, 22777, 25111, 26339, 27947, 29339, 29389, 29527, 29917, 34123, 34421, 34739, 34757, 36527, 36809, 38783, 40433, 40531, 41131, 42859, 43049
Offset: 1

Views

Author

T. D. Noe, May 02 2005

Keywords

Comments

This polynomial is the characteristic polynomial of the Fibonacci and Lucas 5-step sequences, A001591 and A074048. The periods of the sequences A001591(k) mod p and A074048(k) mod p have length less than p.

Crossrefs

Cf. A106278 (number of distinct zeros of x^5-x^4-x^3-x^2-x-1 mod prime(n)), A106298, A106304 (period of Lucas and Fibonacci 5-step mod prime(n)).

Programs

  • Mathematica
    t=Table[p=Prime[n]; cnt=0; Do[If[Mod[x^5-x^4-x^3-x^2-x-1, p]==0, cnt++ ], {x, 0, p-1}]; cnt, {n, 5000}];Prime[Flatten[Position[t, 5]]]
  • Python
    from itertools import islice
    from sympy import Poly, nextprime
    from sympy.abc import x
    def A106281_gen(): # generator of terms
        p = 2
        while True:
            if len(Poly(x*(x*(x*(x*(x-1)-1)-1)-1)-1, x, modulus=p).ground_roots())==5:
                yield p
            p = nextprime(p)
    A106281_list = list(islice(A106281_gen(),20)) # Chai Wah Wu, Mar 14 2024

A106284 Primes p such that the polynomial x^5-x^4-x^3-x^2-x-1 mod p has no zeros.

Original entry on oeis.org

3, 5, 7, 11, 13, 17, 31, 37, 41, 53, 71, 79, 83, 107, 151, 157, 199, 229, 233, 239, 241, 257, 263, 277, 281, 311, 317, 331, 337, 379, 389, 409, 431, 433, 463, 467, 521, 523, 541, 547, 557, 563, 571, 577, 607, 631, 659, 677, 727, 769, 787, 809, 827, 839, 853
Offset: 1

Views

Author

T. D. Noe, May 02 2005

Keywords

Comments

This polynomial is the characteristic polynomial of the Fibonacci and Lucas 5-step sequences, A001591 and A074048.

Crossrefs

Cf. A106278 (number of distinct zeros of x^5-x^4-x^3-x^2-x-1 mod prime(n)), A106298, A106304 (period of Lucas and Fibonacci 5-step sequence mod prime(n)), A003631 (primes p such that x^2-x-1 is irreducible mod p).

Programs

  • Maple
    P:= x^5-x^4-x^3-x^2-x-1:
    select(p -> [msolve(P,p)] = [], [seq(ithprime(i),i=1..10000)]); # Robert Israel, Mar 13 2024
  • Mathematica
    t=Table[p=Prime[n]; cnt=0; Do[If[Mod[x^5-x^4-x^3-x^2-x-1, p]==0, cnt++ ], {x, 0, p-1}]; cnt, {n, 200}];Prime[Flatten[Position[t, 0]]]
  • Python
    from itertools import islice
    from sympy import Poly, nextprime
    from sympy.abc import x
    def A106284_gen(): # generator of terms
        from sympy.abc import x
        p = 2
        while True:
            if len(Poly(x*(x*(x*(x*(x-1)-1)-1)-1)-1, x, modulus=p).ground_roots())==0:
                yield p
            p = nextprime(p)
    A106284_list = list(islice(A106284_gen(),20)) # Chai Wah Wu, Mar 14 2024

Extensions

Name corrected by Robert Israel, Mar 13 2024
Showing 1-3 of 3 results.