A060400 - cp's OEIS frontend

A060400 In base ten, we try to get the digits 0,1,2,3,...,9,0,1,2,3,... in order only using a sequence of increasing primes and each time choosing the smallest prime that will give the desired digit.

%I A060400 #3 Mar 30 2012 16:49:04
%S A060400 101,103,127,131,149,151,163,167,181,191,307,311,421,431,433,457,461,
%T A060400 467,487,491,503,521,523,563,641,653,659,673,683,691,701,719,727,733,
%U A060400 743,751,761,769,787,797,809,811,821,823,941,953,967,971,983,991,1009
%N A060400 In base ten, we try to get the digits 0,1,2,3,...,9,0,1,2,3,... in order only using a sequence of increasing primes and each time choosing the smallest prime that will give the desired digit.
%Y A060400 A060400(n) = A060399(n+9). Cf. A060915, A060916.
%K A060400 base,easy,nonn
%O A060400 0,1
%A A060400 _N. J. A. Sloane_, Apr 04 2001
%E A060400 More terms from Larry Reeves (larryr(AT)acm.org), Apr 09 2001

cp's OEIS Frontend

A060400 In base ten, we try to get the digits 0,1,2,3,...,9,0,1,2,3,... in order only using a sequence of increasing primes and each time choosing the smallest prime that will give the desired digit.