|
| |
|
|
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 base-10 and converting to base-3. 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.
|
|
|
EXAMPLE
| a(3) = 21111 because 21111 is the first number that can produce a sequence of three terms by repeated interpetation as a base 3 number: [21111] (base-3) --> [202] (base-3) --> [20] (base-3) --> [6]. Since 6 cannot be interpretted 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 interprettable as base 3.
|
|
|
CROSSREFS
| Cf. A091049, A141837, A141838, A141839, A141840, A141841, A141842.
Sequence in context: A119864 A036240 A133242 * A083932 A080316 A108020
Adjacent sequences: A141833 A141834 A141835 * A141837 A141838 A141839
|
|
|
KEYWORD
| base,more,nonn
|
|
|
AUTHOR
| Chuck Seggelin (seqfan(AT)plastereddragon.com), Jul 10 2008
|
| |
|
|
