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!)
A273881 Pick any pair of "3" digits in the sequence. Those two "3"s are separated by k digits. This is the lexicographically earliest sequence of distinct terms in which all the resulting values of k are distinct 1

%I #11 Jun 09 2016 08:33:01

%S 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,

%T 26,27,28,29,30,31,40,32,41,42,44,45,46,34,47,43,48,49,50,51,52,54,55,

%U 56,57,58,59,60,35,61,62,64,65,66,67,68,69,70,71,72,74,53,75,76,77,78,63,36,79,80,81,82,84,85,86,87,88,89,90,91,92,94,95,96,97,98,99,100,73,101

%N Pick any pair of "3" digits in the sequence. Those two "3"s are separated by k digits. This is the lexicographically earliest sequence of distinct terms in which all the resulting values of k are distinct

%C The sequence starts with a(1)=0. It is then always extended with the smallest integer not yet present and not leading to a contradiction (which would mean producing a value of k already seen).

%H Eric Angelini, <a href="/A273881/b273881.txt">Table of n, a(n) for n = 1..1011</a>

%Y See A273376 for the equivalent sequence dealing with digit-"1" pairs instead of "3"

%K nonn,base

%O 1,3

%A _Eric Angelini_ and _Jean-Marc Falcoz_ Jun 02 2016

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 March 29 04:23 EDT 2024. Contains 371264 sequences. (Running on oeis4.)