A330048 Cardinalities of the sets of minimal base-n representations of the primes.

2, 3, 3, 8, 7, 9, 15, 12, 26, 152, 17, 228, 240, 100, 483

Offset

2,1

Comments

For a continuation of the sequence see Figure 2 of the Bright, Devillers, Shallit article and Curtis Bright's GitHub repository.

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.

a(30) = 220, a(42) = 4551; private communication from Raymond Devillers. - Hugo Pfoertner, Jan 25 2021

Links

Table of n, a(n) for n=2..16.

Curtis Bright, Raymond Devillers, and Jeffrey Shallit, Minimal Elements for the Prime Numbers, June 11, 2015.

Curtis Bright, Computed data for the MEPN project, GitHub, 2017.

Example

a(10) = 26 because the minimal set of prime-strings in base 10 consist of the 26 terms of A071062.

Crossrefs

Cf. A071062, A111055, A111056, A327282, A330049.

Sequence in context: A202818 A256679 A193997 * A210752 A210599 A211879

Adjacent sequences: A330045 A330046 A330047 * A330049 A330050 A330051

Keyword

nonn,hard,more

Author

Hugo Pfoertner, Nov 29 2019

Status

approved