

A141836


a(n) = first term that can be reduced in n steps via repeated interpretation of a(n) as a base b+1 number where b is the largest digit of a(n), such that b is always 2 so that each interpretation is base 3. Terms already fully reduced (i.e., single digits) are excluded.


6




OFFSET

1,1


COMMENTS

It is possible to compute additional terms by taking the last term, treating it as base10 and converting to base3. This will necessarily create a term which can converted back to base 10 yielding the previous term in the sequence which will itself yield N further terms. But there is no guarantee (except in base 2) that the term so derived will be the first term to produce a sequence of N+1 terms. There could be another, smaller, term which satisfies that requirement but which uses different terms. Pushing the last term of this sequence yields 2120202222022022102 as a possible next term.


LINKS



EXAMPLE

a(3) = 21111 because 21111 is the first number that can produce a sequence of three terms by repeated interpretation as a base 3 number: [21111] (base3) > [202] (base3) > [20] (base3) > [6]. Since 6 cannot be interpreted as a base 3 number, the sequence terminates with 20. a(1) = 12 because 12 is the first number that can be reduced once, yielding no further terms interpretable as base 3.


CROSSREFS



KEYWORD

base,more,nonn


AUTHOR

Chuck Seggelin (seqfan(AT)plastereddragon.com), Jul 10 2008


EXTENSIONS



STATUS

approved



