|
| |
|
|
A091049
|
|
a(n) = first term which reduces to an unchanging value in n steps via repeated interpretation of a(n) as a base b+1 number where b is the largest digit of a(n).
|
|
10
|
|
|
|
1, 10, 15, 17, 18, 58, 72, 80, 88, 507, 683, 838, 1384, 1807, 3417, 12651, 18316, 41841, 80852, 132815, 388315, 1182482, 2202048, 6408851, 15438855, 34630248, 72141683, 332386516, 764388521, 1867287828, 5451218338, 24187765577, 68380483575, 215445843883, 677083325011
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,2
|
|
|
COMMENTS
|
There is no maximum number of steps and for any value of n, there MUST be a term a(n) that reduces in n steps. This is demonstrable as follows: take any term in the above sequence and convert it to base 2. The resulting value, if interpreted as a base 10 value will require one additional step to reduce. The resulting value may not be the FIRST value to resolve in that many steps, however, so it may not belong in this sequence.
|
|
|
LINKS
|
|
|
|
EXAMPLE
|
a(0) = 1 because 1 is the first term that reduces to an unchanging value in zero steps (i.e. 1 is already fully reduced.) a(1) = 10 because 10 reduces in one step (10 in base 2 is 2, 2 does not reduce further.) a(8) = 88 because 88 reduces in 8 steps: 88 --> 80 --> 72 --> 58 --> 53 --> 33 --> 15 --> 11 --> 3.
|
|
|
PROG
|
(Python)
k = 1
while True:
m1 = k
for i in range(n+1):
m2 = int(str(m1), 1+max(int(d) for d in str(m1)))
if m1 == m2:
if i == n:
return k
else:
break
m1 = m2
|
|
|
CROSSREFS
|
Cf. A054055 (largest digit of n) A068505 (n as base b+1 number where b=largest digit of n) A091047 (a(n) = the final value of n reached through repeated interpretation of n as a base b+1 number where b is the largest digit of n) A091048 (number of times n must be interpreted as a base b+1 number where b is the largest digit of n until an unchanging value is reached).
|
|
|
KEYWORD
|
base,nonn
|
|
|
AUTHOR
|
Chuck Seggelin (barkeep(AT)plastereddragon.com), Dec 15 2003, Jul 09 2008
|
|
|
EXTENSIONS
|
|
|
|
STATUS
|
approved
|
| |
|
|
