login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 4

%I #3 Mar 30 2012 16:49:04

%S 101,103,127,131,149,151,163,167,181,191,307,311,421,431,433,457,461,

%T 467,487,491,503,521,523,563,641,653,659,673,683,691,701,719,727,733,

%U 743,751,761,769,787,797,809,811,821,823,941,953,967,971,983,991,1009

%N 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(n) = A060399(n+9). Cf. A060915, A060916.

%K base,easy,nonn

%O 0,1

%A _N. J. A. Sloane_, Apr 04 2001

%E More terms from Larry Reeves (larryr(AT)acm.org), Apr 09 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 06:14 EDT 2024. Contains 371964 sequences. (Running on oeis4.)