[seqfan] Re: Can a repunit be a Fibonacci number?

[Frank Adams-Watters]

Looking at A053696, there appear to be 2 Fibonacci numbers that are non-trivial repunits: 13 (in base 3) and 21 (in base 4).

Franklin T. Adams-Watters


-----Original Message-----
From: Alonso Del Arte <alonso.delarte at gmail.com>
To: Sequence Fanatics Discussion list <seqfan at list.seqfan.eu>
Sent: Fri, May 13, 2016 11:45 am
Subject: [seqfan] Can a repunit be a Fibonacci number?

Sorting the base 10 digits of the Fibonacci numbers (A272918) does not
really seem to go against what we know about Benford's law and the
Fibonacci numbers. But if we sort the digits in descending order, it seems
that, aside from the trivial initial exceptions, no term will start with
the digit 1.

Of course a base 10 repunit is not the only kind of number that would allow
a Fibonacci number to be in this analogue to A272918. A Fibonacci number
that has only 1s and 0s would then become something like 111111111000 in\this sequence, but that seems unlikely as well.
Al-- Alonso del ArteAuthor at SmashWords.com<https://www.smashwords.com/profile/view/AlonsoDelarte>
Musician at ReverbNation.com <http://www.reverbnation.com/alonsodelarte>--Seqfan Mailing list - http://list.seqfan.eu/