Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #16 Jan 25 2021 19:02:41
%S 2,3,3,8,7,9,15,12,26,152,17,228,240,100,483
%N Cardinalities of the sets of minimal base-n representations of the primes.
%C For a continuation of the sequence see Figure 2 of the Bright, Devillers, Shallit article and Curtis Bright's GitHub repository.
%C a(17) >= 1279, a(18) = 50, a(19) >= 3462, a(20) = 651, a(21) >= 2599, a(22) = 1242, a(23) = 6021, a(24) = 306, a(25) >= 17597.
%C a(30) = 220, a(42) = 4551; private communication from Raymond Devillers. - _Hugo Pfoertner_, Jan 25 2021
%H Curtis Bright, Raymond Devillers, and Jeffrey Shallit, <a href="https://cs.uwaterloo.ca/~cbright/reports/mepn.pdf">Minimal Elements for the Prime Numbers</a>, June 11, 2015.
%H Curtis Bright, <a href="https://github.com/curtisbright/mepn-data/">Computed data for the MEPN project</a>, GitHub, 2017.
%e a(10) = 26 because the minimal set of prime-strings in base 10 consist of the 26 terms of A071062.
%Y Cf. A071062, A111055, A111056, A327282, A330049.
%K nonn,hard,more
%O 2,1
%A _Hugo Pfoertner_, Nov 29 2019