login

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”).

A327282
Cardinalities of the minimal sets of base-n representations of the composite numbers.
1
3, 4, 9, 10, 19, 18, 26, 28, 32, 32, 46, 43, 52, 54, 60, 60, 95, 77, 87, 90, 94, 97, 137, 117, 111, 115, 131, 123, 207, 147, 160, 163, 201, 169, 216, 173, 185, 195, 242, 205, 331, 229, 242, 252, 277, 261, 411, 294, 292, 290, 322, 299, 438, 331, 304, 331, 356, 339, 659, 375, 379, 404, 461, 412
OFFSET
2,1
COMMENTS
Second column |M(S_b)| of Figure 4 on page 20 of the Bright, Devillers, Shallit article.
LINKS
Curtis Bright, Raymond Devillers, and Jeffrey Shallit, Minimal Elements for the Prime Numbers, June 11, 2015.
Curtis Bright, Computed data for the MEPN project, data for composites, GitHub, 2015.
Raymond Devillers, Minimal primes and left-right-truncatable primes, GitHub repository, 2021.
Mersenneforum, Generalized minimal (probable) primes, Jan 2021.
EXAMPLE
a(10) = 32 because there are 32 elements in the minimal set of composite-strings in base 10, given in A071070.
CROSSREFS
Sequence in context: A093513 A047230 A277138 * A126269 A319618 A172980
KEYWORD
nonn
AUTHOR
Hugo Pfoertner, Nov 29 2019
EXTENSIONS
a(31)-a(65) from Hugo Pfoertner using data from Raymond Devillers, Jan 12 2021
STATUS
approved