# This is the b255012.txt text file.
# A255012: Where A254596(n) = 4.
# Convert number, n, to the bases, b, 2 through 10. Find the minimum base, b, which yields the greatest sum of the digits. This sequence cites numbers when that base is 4.
# Dated 12 February 2015.



 1   3
 2   730
 3   731
 4   631530
 5   631531
 6   832122
 7   832123
 8   15250123
 9   53223051
10   53263050
11   53263051
12   154121931
13   174700251
14   191805131
15   200061659
16   430750411
17   455521003
18   456042200
19   456042201
20   456042202
21   456042203
22   456043210
23   456043211
24   456110811
25   460301002
26   460301003
27   1211020011
28   1211085531
29   1256504011
30   1261221850
31   1261221851
32   1261418202
33   1261418203
34   1265611403
35   1512551115
36   1512613611
37   1513072330
38   1513072331
39   2066330202
40   2066330203
41   2301081291
42   2301205225
43   2301205226
44   2301205227
45   2334701530
46   2334701531
47   2335159002
48   2335159003
49   2335160024
50   2335160025
51   2335160026
52   2335160027
53   2343363211
54   2347021035
55   2401612507

# This is the end of the b text file.