A094063 Composite n such that Fibonacci(n) == Legendre(n,5) == -1 (mod n).

5777, 10877, 12958, 17302, 40948, 41998, 75077, 88198, 95038, 100127, 113573, 130942, 133742, 156178, 160378, 161027, 162133, 163438, 168838, 203942, 219742, 231703, 300847, 314158, 336598, 390598, 393118, 430127, 467038, 480478, 534508

Offset

1,1

Links

Amiram Eldar, Table of n, a(n) for n = 1..235

Mathematica

Select[ Range[ 2, 100000 ], ! PrimeQ[ # ] && Mod[ Fibonacci[ # ] - JacobiSymbol[ #, 5 ], # ] == 0 && JacobiSymbol[ #, 5 ] == -1 & ]

Prog

(Python)
from itertools import islice
from sympy import nextprime
from sympy.functions.combinatorial.numbers import legendre_symbol
from oeis_sequences.OEISsequences import fibonacci_mod
def A094063_gen(): # generator of terms
    p, q = 4, 5
    while True:
        for m in range(p, q):
            if fibonacci_mod(m, m) == m-1 and legendre_symbol(m, 5) == -1:
                yield m
        p, q = q+1, nextprime(q)
A094063_list = list(islice(A094063_gen(), 30)) # Chai Wah Wu, Jul 13 2026

Crossrefs

Cf. A049062, A090820, A093372.

Sequence in context: A096399 A071132 A228466 * A094395 A094411 A212423

Adjacent sequences: A094060 A094061 A094062 * A094064 A094065 A094066

Keyword

nonn,changed

Author

Eric Rowland, Apr 29 2004

Extensions

More terms from Ryan Propper, Nov 07 2006

Status

approved