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!)
A282868 For all n's, the set including the terms {a(1), a(2), a(3), ..., a(n)} has a prime number of digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9. 1

%I #42 Jun 02 2024 14:22:35

%S 11,1,22,2,33,3,44,4,55,5,66,6,77,7,88,8,99,9,1001,0,1010,1111,1100,

%T 2222,3333,4444,5555,6666,7777,8888,9999,111111,222222,333333,444444,

%U 555555,666666,777777,888888,999999,10000111,200222,200002,202022,11111111

%N For all n's, the set including the terms {a(1), a(2), a(3), ..., a(n)} has a prime number of digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9.

%C The sequence is started with a(1) = 11 and always extended with the smallest integer not yet present and not leading to a contradiction.

%H Giovanni Resta, <a href="/A282868/b282868.txt">Table of n, a(n) for n = 1..100</a>

%e The set made of the first 6 terms is {11,1,22,2,33,3}; we count three 1's, three 2's and three 3's.

%K nonn,base

%O 1,1

%A _Eric Angelini_ and _Jean-Marc Falcoz_, Mar 17 2017

%E Data corrected by _Giovanni Resta_, Mar 17 2017

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 August 14 22:14 EDT 2024. Contains 375167 sequences. (Running on oeis4.)