A023182 Numbers k such that Fibonacci(k) == 89 (mod k).

1, 2, 3, 11, 21, 22, 92, 121, 133, 209, 319, 341, 451, 493, 649, 671, 781, 869, 979, 1111, 1131, 1199, 1419, 1441, 1529, 1639, 1661, 1969, 1991, 2101, 2189, 2321, 2519, 2629, 2651, 2761, 2773, 2959, 2981, 3091, 3421, 3641, 3839, 3949, 4169, 4279, 4411, 4499

Offset

1,2

Links

Chai Wah Wu, Table of n, a(n) for n = 1..10000

Prog

(Python)
# uses Python code in A002708
from itertools import count
def A023182_gen(startvalue=1): # generator of terms >= startvalue
    for k in count(max(startvalue, 1)):
        if A002708(k)==89%k:
            yield k # Chai Wah Wu, Jun 30 2026

Crossrefs

Cf. A000045.

Sequence in context: A097895 A298351 A359017 * A302310 A295958 A049083

Adjacent sequences: A023179 A023180 A023181 * A023183 A023184 A023185

Keyword

nonn,changed

Author

David W. Wilson

Status

approved