|
%I #16 Apr 30 2015 04:45:43
%S 0,3,6,9,12,15,18,21,24,27,42,45,48,51,54,57,72,75,78,81,84,87,111,
%T 114,117,141,144,147,171,174,177,222,225,228,252,255,258,282,285,288,
%U 411,414,417,441,444,447,471,474,477,522,525,528,552,555,558,582,585,588
%N Minimal "multiples of 3" set in base 10.
%C 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.
%H Nathaniel Johnston, <a href="/A071073/b071073.txt">Table of n, a(n) for n = 1..76</a> (full sequence)
%H J.-P. Delahaye, <a href="http://www.pourlascience.fr/ewb_pages/a/article-nombres-premiers-inevitables-et-pyramidaux-24978.php">Nombres premiers inévitables et pyramidaux</a>, Pour la Science 296 (2002), p 102.
%Y Cf. A071062, A071071, A071072, A071070.
%K fini,full,nonn,base
%O 1,2
%A _Benoit Cloitre_, May 26 2002
|
