OFFSET
1,1
COMMENTS
Open problems:
(1) What is the asymptotic growth of this sequence?
(2) Is there any efficient way to calculate the sequence?
The sequence is infinite. See Hartley (2026).
LINKS
Nakul Badjatya, SageMath program
Michael Hartley, Proof that the sequence is infinite, Mathematics Stack Exchange, 2026.
EXAMPLE
Start with first prime 2. Now as the sequence is empty, 2 is admitted to the sequence.
Now to check whether 3 belongs to the sequence, we have to check if one can have 2^k = 3 with k >= 1. Since this is not possible, 3 is admitted.
The next prime is 5. But 2^1 + 3^1 = 5, so 5 is not admitted to the sequence.
PROG
(SageMath) # See Badjatya link
CROSSREFS
KEYWORD
nonn,hard,more,changed
AUTHOR
Nakul Badjatya, May 27 2026
EXTENSIONS
a(16)-a(20) from Michael S. Branicky, Jun 15 2026
a(21) from Michael S. Branicky, Jun 22 2026
STATUS
approved
