The OEIS is fantastic of course. Lots of contributions (from professionals and amateurs alike), many interesting conjectures, and thus nice opportunies to learn more.

Here’s one conjecture though which unfortunately doesn’t work out (feel free to edit the corresponding entry A113910 accordingly). I’ll try to reconstruct here how I think the conjecture was made, and how it breaks down.

Lucas numbers are given by the second-order linear reccurence: , and . There’s an explicit formula for the n-th term involving the golden ratio, .

An interesting property is that whenever is a prime, one can prove that (see the first few pages of Sun’s review on congruences of Lucas numbers). But this happens for some composite integers too, which have hence been named Lucas pseudoprimes. Ok, so for those integers (primes and Lucas pseudoprimes) we have defined some such that .

Now, on the OEIS page about Lucas numbers there’s a remark by Ward that

is the number of points of period n in the golden mean shift. The number of orbits of length n in the golden mean shift is given by the n-th term of the sequence A006206.

Indeed, recall that the shift associated to the golden ratio is , where is the space of sequences made of 0’s and 1’s such that no consecutive 1’s appear. This is equivalent to a dynamics modulo 1, namely , if we code by 0 the interval and by 1 the interval . (See the Scholarpedia article by Marcus and Williams for references).

Moreover, on the page about A006206 one finds the remark that , where I’ve noted the terms of A006206. So, implicitely, this means that whenever is prime we have .

Probably this last observation is what lead Dement to his conjecture linking twin primes and Lucas numbers as mentionned in sequence A113910 (I’m rephrasing it slightly):

for , if is an integer then it is a prime, and those primes are exactly the lesser of a twin pairs (i.e. a characterization of twins).

The conjecture is made by remarking that if and are twin primes, well they are both primes so satisfy , and then using the Lucas reccurence relation one obtains that is an integer, and the conjecture asks whether the converse holds.

But there’s the problem. Just forgetting what is, it’s clear that when defined, so the conjecture asserts that Lucas pseudoprimes (for which is also an integer) are never at a distance equal to 2 of a prime (i.e are never creating a pair n, n+2 which would pass the integrality test).

Unfortunately 5777 is a Lucas pseudoprime, and 5779 is a prime.

One great thing I’ve been made aware of while looking at that stuff are the results of Lagarias which in particular say that the set of primes which divide some Lucas number has density 2/3 , and that more work by various authors has been done since.