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

Smallest nonempty set S containing prime divisors of 10k+3 for each k in S.
1

%I #11 Feb 16 2013 16:57:08

%S 7,11,13,17,19,23,29,31,37,41,43,47,59,61,67,71,73,79,83,89,101,103,

%T 107,113,127,131,137,139,151,167,173,193,199,229,233,239,241,263,293,

%U 313,317,347,349,353,373,389,397,419,433,443,461,463,499,563,593,599

%N Smallest nonempty set S containing prime divisors of 10k+3 for each k in S.

%H Nathaniel Johnston, <a href="/A020633/b020633.txt">Table of n, a(n) for n = 1..106</a> (full sequence)

%K nonn,fini,full

%O 1,1

%A _David W. Wilson_