[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
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”).

A071073
Minimal "multiples of 3" set in base 10.
8
0, 3, 6, 9, 12, 15, 18, 21, 24, 27, 42, 45, 48, 51, 54, 57, 72, 75, 78, 81, 84, 87, 111, 114, 117, 141, 144, 147, 171, 174, 177, 222, 225, 228, 252, 255, 258, 282, 285, 288, 411, 414, 417, 441, 444, 447, 471, 474, 477, 522, 525, 528, 552, 555, 558, 582, 585, 588
OFFSET
1,2
COMMENTS
Any multiple of 3 contains in its digits at least one of the terms of this sequence. There are 76 terms in the sequence; Delahaye gives all 76 terms and proves that there are no further terms (his statement that there are 280 terms seems to be a typo). There is no smaller set.
LINKS
Nathaniel Johnston, Table of n, a(n) for n = 1..76 (full sequence)
J.-P. Delahaye, Nombres premiers inévitables et pyramidaux, Pour la Science 296 (2002), p 102.
CROSSREFS
KEYWORD
fini,full,nonn,base
AUTHOR
Benoit Cloitre, May 26 2002
STATUS
approved