Scout the Routes

Triangles? Yes. Squares? No. If you scout the routes with a triangle, you get a beautiful fractal. If you scout the routes with a square, you don’t. Here’s what you get with a triangle:

A Sierpiński triangle


But how do you scout the routes? (That phrase works best in the American dialects where “scout” rhymes with “route”.) Simple: you mark the final positions reached when a point traces all possible ways of jumping, say, eight times 1/2-way towards the vertices of a polygon. Here’s an animation of a point scouting the routes of eight jumps towards the vertices of a triangle (it starts each time at the center):

Creating a Sierpiński triangle by scouting the routes (animated at Ezgif)


If you scout the routes with a square, you don’t get a fractal. Instead, the interior of the square fills evenly (and boringly) with the end-points of the routes:

Scouting the routes with a square (animated at Ezgif)


But you can create fractals with a square if you out routes as you scout routes. That is, if you exclude some routes and don’t mark their end-points. One way to do this is to compare the proposed next jump-vertex (vertex-jumped-towards) with the previous jump-vertex. For example, if the proposed jump-vertex, jv[t], is the same as the previous jump-vertex, jv[t-1], you don’t jump towards jv[t] or you jump towards it in a different way. The test is jv[t] = jv[t-1] + vi. If vi = 0 and you jump towards the clockwise neighbor of jv when the test is true, you get a fractal looking like this:

vi = 0, action = jv → jv + 1


Here’s the fractal if you jump towards the clockwise-neighbor-but-one when the test is true:

vi = 0, action = jv + 2


Now try varying the vi of the jv[t-1] + vi:

vi = 2, action = jv + 2


vi = 2, action = jv + 1


vi = 3, action = jv + 1


Or what about jumping in a different way towards jv when the test is true? If you jump 2/3 of the way rather 1/2, you get his fractal:

vi = 2, action = jump 2/3


And if you jump 4/3 of the way (i.e., you overshoot the vertex jv), you get this fractal:

vi = 0, action = jump 4/3rds to vertex


vi = 0, jump 4/3 (guide-square removed)


vi = 2, jump 4/3rds (guide-square removed)


And in this fractal the point jumps 2/3 of the way to the center of the square when the test is true:

vi = 2, action = jump 2/3rds of way to center of square


But why apply only one test to jv[1] and use only when one alternative jump? If jv[t] = jv[t-1] + 1 or jv[t] = jv[t-1] + 3, jv[t] becomes jv[t]+1 or jv[t]+3, respectively, you get this fractal:

vi = 1, jv + 1; vi = 3, jv + 3


Here are more fractals created by single and double tests:

vi = 1, jv + 1


vi = 0, jump 2/3


vi = 0, jump towards center 2/3rds


vi = 1, jump-center 2/3


vi = 2, jump 1/3; vi = 3, jump 1/1 (i.e, 1)


vi = 0, jv + 2; vi = 2, jump-center 1/2


vi = 0, jv + 2; vi = 2, jump-center 2/3


vi = 0, jv + 2; vi = 2, jump-center 4/3


vi = 0, jv + 1; vi = 2, jump 2/3


vi = 0, jv + 2; vi = 2, jump 2/3


vi = 0, jump 4/3; vi = 2, jv + 2


vi = 0, jump 2/3; vi = 2, jv + 1


vi = 0, jump 4/3; vi = 1, jv + 2


vi = 0, jump 2/3; vi = 2, jump 1/3


vi =0, jump 1/3; vi = 2, jump 2/3


vi = 0, jump 0/1 (i.e, 0); vi = 2, jump 1/3


Rankle Biter

rankle, verb 1. (transitive or intransitive) To cause irritation, bitterness or acrimony. 2. (intransitive) To fester.

Etymology: From Middle English ranklen, ranclen, from Old French rancler, räoncler, draoncler (“to ulcerate, to form a boil”), from Old French draoncle (“a boil”), from Latin dracunculus (“little serpent”), diminutive of Latin dracō (“serpent, dragon”).

rankle at Wiktionary

Primal Pellicles

Numbers have thin skins. And they’re easily replaced. Take 71624133. Here it is permuting its pellicles:

71624133 in base 10 = 100010001001110010111000101 in base 2 = 11222202212211200 in b3 = 10101032113011 in b4 = 121313433013 in b5 = 11035053113 in b6 = 1526536500 in b7 = 421162705 in b8 = 158685750 in b9 = 374802A9 in b11 = 1BBA1199 in b12 = 11AB9B59 in b13 = 9726137 in b14 = 644BE73 in b15 = F3855B7 in b16

But if digits are the skin of 71624133, what are its bones? Well, you could say the skeleton of a number, something that doesn’t change from base to base, is its prime factorization:

71624133 = 32 × 72 × 162413

But the primes themselves are numbers, so they’re wearing pellicles too. And it turns out that, in base 10, the pellicles of the prime factors of 71624133 match the pellicle of 71624133 itself:

71624133 = 32.72.162413

Here’s a list of primal pellicles in base 10:

735 = 3.5.72
3792 = 24.3.79
1341275 = 52.13.4127
13115375 = 53.7.13.1153
22940075 = 52.229.4007
29373375 = 3.53.29.37.73
71624133 = 32.72.162413
311997175 = 52.7.172.31.199
319953792 = 27.3.53.79.199
1019127375 = 32.53.7.127.1019
1147983375 = 3.53.7.11.83.479
1734009275 = 52.173.400927
5581625072 = 24.5581.62507
7350032375 = 53.7.23.73.5003
17370159615 = 34.5.17.59.61.701
33061224492 = 22.33.306122449
103375535837 = 72.37.103.553583
171167303912 = 23.11.172.6730391
319383665913 = 3.133.19.383.6659
533671737975 = 34.52.17.53.367.797
2118067737975 = 32.52.7.79.211.80677
3111368374257 = 3.112.132.683.74257
3216177757191 = 3.73.191.757.21617
3740437158475 = 52.37.4043715847
3977292332775 = 3.52.292.233.277.977
4417149692375 = 53.7.23.4969.44171
7459655393232 = 24.32.72.23.45965539
7699132721175 = 3.52.72.27211.76991
7973529228735 = 3.5.7.972.2287.3529
10771673522535 = 34.5.67.71.107.52253

You can find them at the Online Encyclopedia of Integer Sequences under A121342, “Composite numbers that are a concatenation of their distinct prime divisors in some order.” But what about pairs of primal pellicles, that is, pairs of numbers where the prime factors of each form the pellicle of the other?

35 = 5.775 = 3.52
1275 = 3.52.173175 = 52.127
131715 = 32.5.2927329275 = 52.13171
3199767 = 3.359.297135932971 = 3.19.67.972
14931092 = 22.11.61.5563116155632 = 24.3.109.1492

And here are a few primal pellicles I’ve found in other bases:

Primal Pellicles in Base 2

1111011011110 = 10.1110.110110111 in b2 = 7902 = 2.32.439 in b10
1110001100110111 = 1110.10111.100011001 in b2 = 58167 = 32.23.281 in b10
1111011011011110 = 10.1110.110110110111 in b2 = 63198 = 2.32.3511 in b10
11101001100001101 = 1110.101.101001100001 in b2 = 119565 = 32.5.2657 in b10
1111011011011011110 = 10.1110.110110110110111 in b2 = 505566 = 2.32.28087 in b10
1111011111101111011 = 1110.1011.10111.11011111 in b2 = 507771 = 32.11.23.223 in b10


Primal Pellicles in Base 3

121022 = 210.12.102 in b3 = 440 = 23.5.11 in b10
212212 = 22.21.212 in b3 = 644 = 22.7.23 in b10
20110112 = 210.201.1011 in b3 = 4712 = 23.19.31 in b10
21110110 = 10.212.1101 in b3 = 5439 = 3.72.37 in b10
121111101 = 122.111.1101 in b3 = 12025 = 52.13.37 in b10
222112121 = 22.21.221121 in b3 = 19348 = 22.7.691 in b10
2202122021 = 22.2021.22021 in b3 = 54412 = 22.61.223 in b10
120212201221 = 2.122.21.201.1202 in b3 = 312550 = 2.52.7.19.47 in b10


Primal Pellicles in Base 7

2525 = 2.52.25 in b7 = 950 = 2.52.19 in b10
3210 = 2.34.10 in b7 = 1134 = 2.34.7 in b10
5252 = 2.52.52 in b7 = 1850 = 2.52.37 in b10
332616 = 33.16.326 in b7 = 58617 = 33.13.167 in b10
336045 = 32.5.3604 in b7 = 59715 = 32.5.1327 in b10
2251635 = 22.3.5.16.252 in b7 = 281580 = 22.3.5.13.192 in b10


Primal Pellicles in Base 11

253 = 22.3.52 in b11 = 300 = 22.3.52 in b10
732 = 2.32.72 in b11 = 882 = 2.32.72 in b10
2123 = 23.33.12 in b11 = 2808 = 23.33.13 in b10
3432 = 25.3.43 in b11 = 4512 = 25.3.47 in b10
3710 = 32.72.10 in b11 = 4851 = 32.72.11 in b10
72252 = 23.72.225 in b11 = 105448 = 23.72.269 in b10


Primal Pellicles in Base 15

275 = 24.5.7 in b15 = 560 = 24.5.7 in b10
2D5 = 2.52.D in b15 = 650 = 2.52.13 in b10
2CD5 = 2.52.CD in b15 = 9650 = 2.52.193 in b10
7BE3 = 3.72.BE in b15 = 26313 = 3.72.179 in b10
21285 = 24.52.128 in b15 = 105200 = 24.52.263 in b10

Palme D’Awe

A coco de mer at the Eden Project


A rare and endangered palm at the Eden Project is thought to have made botanical history by producing the UK’s largest mature leaf of its kind, about 13ft (4m) long. The coco de mer, native to the Seychelles, was grown from a seed in the Cornwall attraction’s rainforest biome. The seed, given by the Seychelles Ministry of Agriculture in 2003, has now developed into a plant with a massive mature leaf. Over the next decade, the leaf could grow to 8-10m long, the Eden Project said. — Rare palm’s 13ft leaf thought to be UK’s largest, BBC News, 20ix25

So Tsu Me

The Japanese word for unread books, particularly books that have been bought but not yet read, is tsundoku (積ん読). This term refers to the phenomenon of acquiring books and letting them pile up unread, rather than reading them. — AI Overview at Google


Elsewhere Other-Accessible…

Tsundoku at Wikipedia

Lime Time

What do you get if you list every successive pair of entries in this sequence?

1, 2, 1, 3, 2, 3, 1, 4, 3, 4, 1, 5, 2, 5, 3, 5, 4, 5, 1, 6, 5, 6, 1, 7, 2, 7, 3, 7, 4, 7, 5, 7, 6, 7, 1, 8, 3, 8, 5, 8, 7, 8, 1, 9, 2, 9, 4, 9, 5, 9, 7, 9, 8, 9, 1, 10, 3, 10, 7, 10, 9, 10, 1, 11, 2, 11, 3, 11, 4, 11, 5, 11, 6, 11, 7, 11, 8, 11, 9, 11, 10, 11, 1, 12, 5, 12, 7, 12, 11, 12, 1, 13, … — A038568 at the Online Encyclopedia of Integer Sequence

You get the rational fractions ordered by denominator in their simplest form: 1/2, 1/3, 2/3, 1/4, 3/4, 1/5, 2/5, 3/5… There are no pairs like 2/4 and 5/35, because those can be simplified: 2/4 → 1/2; 15/35 → 3/7. You can get the same set of rational fractions by listing every successive pair in this sequence, the Stern-Brocot sequence:

1, 2, 1, 3, 2, 3, 1, 4, 3, 5, 2, 5, 3, 4, 1, 5, 4, 7, 3, 8, 5, 7, 2, 7, 5, 8, 3, 7, 4, 5, 1, 6, 5, 9, 4, 11, 7, 10, 3, 11, 8, 13, 5, 12, 7, 9, 2, 9, 7, 12, 5, 13, 8, 11, 3, 10, 7, 11, 4, 9, 5, 6, 1, 7, 6, 11, 5, 14, 9, 13, 4, 15, 11, 18, 7, 17, 10, 13, 3, 14, 11, 19, 8, 21, 13, 18, 5, 17, 12, 19, … — A002487 at the OEIS

But the fractions don’t come ordered by denominator this time. In fact, they seem to come at random: 1/2, 1/3, 2/3, 1/4, 3/5, 2/5, 3/4, 1/5, 4/7, 3/8, 5/7, 2/7, 5/8… But they’re not random at all. There’s a complicated way of generating them and a simple way. An amazingly simple way, I think:

Moshe Newman proved that the fraction a(n+1)/a(n+2) can be generated from the previous fraction a(n)/a(n+1) = x by 1/(2*floor(x) + 1 – x). The successor function f(x) = 1/(floor(x) + 1 – frac(x)) can also be used. — A002487, “Stern-Brocot Sequence”, at the OEIS

In another form, the Stern-Brocot sequence is generated by what’s called the Calkin-Wilf Tree. Now suppose you use the Stern-Brocot sequence to supply the x co-ordinate of an L-graph whose arms run from 0 to 1. And you use the Calkin-Wilf Tree to supply the y co-ordinate of the L-tree. What do you get? As I described in “I Like Gryke”, you get this fractal:

Limestone fractal


I call it a limestone fractal or pavement fractal or gryke fractal, because it reminds me of the fissured patterns you see in the limestone pavements of the Yorkshire Dales:

Fissured limestone pavement, Yorkshire Dales (Wikipedia)


But what happens when you plot the (x,y) of the Stern-Brocot sequence and the Calkin-Wilf Tree on a circle instead? You get an interestingly distorted limestone fractal:

Limestone fractal on circle


You can also plot the (x,y) around the perimeter of a polygon, then stretch the polygon into a circle. Here’s a square:

Limestone fractal on square

Limestone square stretched to circle


And here are a pentagon, hexagon, heptagon and octagon — note the interesting perspective effects:

Limestone fractal on pentagon

Limestone pentagon stretched to circle


Limestone fractal on hexagon

Limestone hexagon stretched to circle


Limestone fractal on heptagon

Limestone heptagon stretched to circle


Limestone fractal on octagon

Limestone octagon stretched to circle


And finally, here are animations of limestone polygons stretching to circles:

Limestone square stretched to circle (animated at EZgif)


Limestone pentagon to circle (animated)


Limestone hexagon to circle (animated)


Limestone heptagon to circle (animated)


Limestone octagon to circle (animated)


Previously Pre-Posted (Please Peruse)

I Like Gryke — a first look at the limestone fractal

Summer-Time Twos

I wondered how often the digits of n2 appeared in sum(n1,n2). For example:

17 → 117 = sum(9,17)
20200 = sum(5,20); 204,4; 207,3; 209,2 (c=4)

As I looked at higher n2, I found that the 2-views continued:

63 → 363 = sum(58,63); 638,53; 1638,28; 1763,23; 1863,18 (c=5)
88 → 1288 = sum(73,88); 2788,48; 2881,46; 3388,33; 3880,9; 3888,8 (c=6)
20020009 = sum(14,200); 20022,13; 20034,12; 20045,11; 20055,10; 20064,9;
200
72,8; 20079,7; 20085,6; 20090,5; 20094,4; 20097,3; 20099,2 (c=13)
558 → 39558 = sum(483,558); 55833,448; 95583,348; 105558,318; 125580,247; 126558,243; 143558,158; 152558,83; 155583,28; 155808,18; 155825,17; 155841,16; 155856,15; 155870,14; 155883,13; 155895,12 (c=16)
20002000010 = sum(45,2000); 2000054,44; 2000097,43; 2000139,42; 2000180,41; 2000220,40; 2000259,39; 2000297,38; 2000334,37; 2000370,36; 2000405,35; 2000439,34; 2000472,33; 2000504,32; 2000535,31; 2000565,30;
2000594,29; 2000622,28; 2000649,27; 2000675,26; 2000700,25; 2000724,24; 2000747,23; 2000769,22; 2000790,21; 2000810,20; 2000829,19; 2000847,18; 2000864,17; 2000880,16; 2000895,15; 2000909,14; 2000922,13; 2000934,
12; 2000945,11; 2000955,10; 2000964,9; 2000972,8; 2000979,7; 2000985,6; 2000990,5; 2000994,4; 2000997,3; 2000999,2 (c=44)

But what about other bases?

Base 9

15 in b9 → 115 = sum(5,15) (n=14 in b10) (c=1)
18 in b9 → 118 = sum(11,17); 180,1 (n=17 in b10) (c=2)
20 in b9 → 203 = sum(4,18); 206,3; 208,2 (n=18 in b10) (c=3)
45 in b9 → 445 = sum(32,41); 745,25; 1045,15; 1145,5 (n=41 in b10) (c=4)
55 in b9 → 555 = sum(41,50); 1055,35; 1355,25; 1555,15; 1655,5 (n=50 in b10) (c=5)
65 in b9 → 665 = sum(50,59); 1265,45; 1665,35; 2065,25; 2265,15; 2365,5 (n=59 in b10) (c=6)
75 in b9 → 775 = sum(59,68); 1475,55; 2075,45; 2475,35; 2750,26; 2775,25; 3075,15; 3175,5 (n=68 in b10) (c=8)
85 in b9 → 885 = sum(68,77); 1685,65; 2385,55; 2885,45; 3385,35; 3685,25; 3853,17; 3885,15; 4085,5 (n=77 in b10) (c=9)
200 in b9 → 20003 = sum(13,162); 20016,13; 20028,12; 20040,11; 20050,10; 20058,8; 20066,7; 20073,6; 20078,5; 20083,4; 20086,3; 20088,2 (n=162 in b10) (c=12)
415 in b9 → 13415 = sum(311,338); 25415,345; 36415,315; 41525,302; 46415,275; 55415,245; 63415,215; 64155,212; 70415,175; 75415,145; 80415,115; 83415,75; 85415,45; 86415,15 (n=338 in b10) (c=14)
[…]
2000 in b9 → 2000028 = sum(38,1458); 2000070,41; 2000120,40; 2000158,38; 2000206,37; 2000243,36; 2000278,35; 2000323,34; 2000356,33; 2000388,32; 2000430,31; 2000460,30; 2000488,28; 2000526,27; 2000553,26; 2000578,25; 2000613,24; 2000636,23; 2000658,22; 2000680,21; 2000710,20; 2000728,18; 2000746,17; 2000763,16; 2000778,15; 2000803,14; 2000816,13; 2000828,12; 2000840,11; 2000850,10; 2000858,8; 2000866,7; 2000873,6; 2000878,5; 2000883,4; 2000886,3; 2000888,2 (n=1458 in b10) (c=37)


Base 11

16 in b11 → 116 = sum(6,16) (n=17 in b10) (c=1)
20 in b11 → 201 = sum(5,22); 205,4; 208,3; 20A,2 (n=22 in b10) (c=4)
56 in b11 → 556 = sum(50,61); 956,36; 1156,26; 1356,16; 1456,6 (n=61 in b10) (c=5)
66 in b11 → 666 = sum(61,72); 1066,46; 1466,36; 1669,2A; 1766,26; 1966,16; 1A66,6 (n=72 in b10) (c=7)
86 in b11 → 886 = sum(83,94); 1486,66; 1A86,56; 2486,46; 2886,36; 3086,26; 3286,16; 3386,6 (n=94 in b10) (c=8)
96 in b11 → 996 = sum(94,105); 1696,76; 2296,66; 2896,56; 3296,46; 3696,36; 3996,26; 4096,16; 4196,6 (n=105 in b10) (c=9)
A6 in b11 → AA6 = sum(105,116); 18A6,86; 25A6,76; 31A6,66; 37A6,56; 41A6,46; 45A6,36; 48A6,26; 4AA6,16; 50A6,6 (n=116 in b10) (c=10)
200 in b11 → 1200A = sum(156,242); 20001,15; 20015,14; 20028,13; 2003A,12; 20050,11; 20060,10; 2006A,A; 20078,9; 20085,8; 20091,7; 20097,6; 200A1,5; 200A5,4; 200A8,3; 200AA,2 (n=242 in b10) (c=16)
[…]
A66 in b11 → 1AA66 = sum(1260,1282); A1A66,966; 109A66,946; 182A66,866; 198A66,846; 23A666,786; 253A66,766; 267A66,746; 314A66,666; 326A66,646; 375A66,566; 385A66,546; 416A66,466; 424A66,446; 457A66,366; 463A66,346; 46A666,326; 488A66,266; 492A66,246; 4A6666,186; 4A9A66,166; 501A66,146; 50AA66,66; 510A66,46 (n=1282 in b10) (c=24)
2000 in b11 → 2000005 = sum(52,2662); 2000051,47; 2000097,46; 2000131,45; 2000175,44; 2000208,43; 200024A,42; 2000290,41; 2000320,40; 200035A,3A; 2000398,39; 2000425,38; 2000461,37; 2000497,36; 2000521,35; 2000555,34; 2000588,33; 200060A,32; 2000640,31; 2000670,30; 200069A,2A; 2000718,29; 2000745,28; 2000771,27; 2000797,26; 2000811,25; 2000835,24; 2000858,23; 200087A,22; 20008A0,21; 2000910,20; 200092A,1A; 2000948,19; 2000965,18; 2000981,17; 2000997,16; 2000A01,15; 2000A15,14; 2000A28,13; 2000A3A,12; 2000A50,11; 2000A60,10; 2000A6A,A; 2000A78,9; 2000A85,8; 2000A91,7; 2000A97,6; 2000AA1,5; 2000AA5,4; 2000AA8,3; 2000AAA,2 (n=2662 in b10) (c=51)


Base 3

12 in b3 → 112 = sum(2,12); 120,1 (n=5 in b10) (c=2)
20 in b3 → 120 = sum(4,6); 200,10; 202,2 (n=6 in b10) (c=3)
122 in b3 → 10122 = sum(11,17); 11122,22; 11220,21; 12122,2; 12200,1 (n=17 in b10) (c=5)
1212 in b3 → 121212 = sum(41,50); 1001212,1012; 1101212,212; 1112120,200; 1121212,112; 1201212,12 (n=50 in b10) (c=6)
1222 in b3 → 122222 = sum(44,53); 1101222,1002; 1111222,222; 1112220,221; 1212222,102; 1221222,2; 1222000,1 (n=53 in b10) (c=7)
2000 in b3 → 1112000 = sum(28,54); 1120000,1000; 2000020,21; 2000110,20; 2000122,12; 2000210,11; 2000220,10; 2000222,2 (n=54 in b10) (c=8)
[…]
20000 in b3 → 111120000 = sum(82,162); 111200000,10000; 200000010,111; 200000120,110; 200000222,102; 200001100,101; 200001200,100; 200001222,22; 200002020,21; 200002110,20; 200002122,12; 200002210,11; 200002220,10; 200002222,2 (n=162 in b10) (c=14)


Base 4

13 in b4 → 130 = sum(1,13) (n=7 in b10) (c=1)
20 in b4 → 201 = sum(3,8); 203,2 (n=8 in b10) (c=2)
200 in b4 → 20001 = sum(6,32); 20012,11; 20022,10; 20031,3; 20033,2 (n=32 in b10) (c=5)
2000 in b4 → 2000021 = sum(11,128); 2000103,22; 2000130,21; 2000210,20; 2000223,13; 2000301,12; 2000312,11; 2000322,10; 2000331,3; 2000333,2 (n=128 in b10) (c=10)
20000 in b4 → 200000003 = sum(23,512); 200000121,112; 200000232,111; 200001002,110; 200001111,103; 200001213,102; 200001320,101; 200002020,100; 200002113,33; 200002211,32; 200002302,31; 200002332,30; 200003021,23; 200003103,22; 200003130,21; 200003210,20; 200003223,13; 200003301,12; 200003312,11; 200003322,10; 200003331,3; 200003333,2 (n=512 in b10) (c=22)


Base 8

17 in b8 → 170 = sum(1,17) (n=15 in b10) (c=1)
20 in b8 → 202 = sum(4,16); 205,3; 207,2 (n=16 in b10) (c=3)
200 in b8 → 20011 = sum(11,128); 20023,12; 20034,11; 20044,10; 20053,7; 20061,6; 20066,5; 20072,4; 20075,3; 20077,2 (n=128 in b10) (c=10)
2000 in b8 → 2000020 = sum(32,1024); 2000057,37; 2000115,36; 2000152,35; 2000206,34; 2000241,33; 2000273,32; 2000324,31; 2000354,30; 2000403,27; 2000431,26; 2000456,25; 2000502,24; 2000525,23; 2000547,22; 200057
0,21; 2000610,20; 2000627,17; 2000645,16; 2000662,15; 2000676,14; 2000711,13; 2000723,12; 2000734,11; 2000744,10; 2000753,7; 2000761,6; 2000766,5; 2000772,4; 2000775,3; 2000777,2 (n=1024 in b10) (c=31)


Base 16

1F in b16 → 1F0 = sum(1,1F) (n=31 in b10) (c=1)
20 in b16 → 201 = sum(6,32); 206,5; 20A,4; 20D,3; 20F,2 (n=32 in b10) (c=5)
200 in b16 → 20003 = sum(23,512); 20019,16; 2002E,15; 20042,14; 20055,13; 20067,12; 20078,11; 20088,10; 20097,F; 200A5,E; 200B2,D; 200BE,C; 200C9,B; 200D3,A; 200DC,9; 200E4,8; 200EB,7; 200F1,6; 20
0
F6,5; 200FA,4; 200FD,3; 200FF,2 (n=512 in b10) (c=22)
[…]
EE4 in b16 → 42EE4A = sum(961,EE4); 6EE413,16; 6EE428,15; 6EE43C,14; 6EE44F,13; 6EE461,12; 6EE472,11; 6EE482,10; 6EE491,F; 6EE49F,E; 6EE4AC,D; 6EE4B8,C; 6EE4C3,B; 6EE4CD,A; 6EE4D6,9; 6EE4DE,8; 6EE4E5,7; 6EE4EB,6; 6EE4F0,5; 6EE4F4,4; 6EE4F7,3; 6EE4F9,2; 6EE4FA,1 (n=3812 in b10) (c=23)
2000 in b16 → 2000001 = sum(5B,2000); 200005B,5A; 20000B4,59; 200010C,58; 2000163,57; 20001B9,56; 200020E,55; 2000262,54; 20002B5,53; 2000307,52; 2000358,51; 20003A8,50; 20003F7,4F; 2000445,4E; 2000492,4D; 20004DE,4C; 2000529,4B; 2000573,4A; 20005BC,49; 2000604,48; 200064B,47; 2000691,46; 20006D6,45; 200071A,44; 200075D,43; 200079F,42; 20007E0,41; 2000820,40; 200085F,3F; 200089D,3E; 20008DA,3D; 2000916,3C; 2000951,3B; 200098B,3A; 20009C4,39; 20009FC,38; 2000A33,37; 2000A69,36; 2000A9E,35; 2000AD2,34; 2000B05,33; 2000B37,32; 2000B68,31; 2000B98,30; 2000BC7,2F; 2000BF5,2E; 2000C22,2D; 2000C4E,2C; 2000C79,2B; 2000CA3,2A; 2000CCC,29; 2000CF4,28; 2000D1B,27; 2000D41,26; 2000D66,25; 2000D8A,24; 2000DAD,23; 2000DCF,22; 2000DF0,21; 2000E10,20; 2000E2F,1F; 2000E4D,1E; 2000E6A,1D; 2000E86,1C; 2000EA1,1B; 2000EBB,1A; 2000ED4,19; 2000EEC,18; 2000F03,17; 2000F19,16; 2000F2E,15; 2000F42,14; 2000F55,13; 2000F67,12; 2000F78,11; 2000F88,10; 2000F97,F; 2000FA5,E; 2000FB2,D; 2000FBE,C; 2000FC9,B; 2000FD3,A; 2000FDC,9; 2000FE4,8; 2000FEB,7; 2000FF1,6; 2000FF6,5; 2000FFA,4; 2000FFD,3; 2000FFF,2 (n=8192 in b10) (c=90)


Previously Pre-Posted (Please Peruse)

Summer-Time Hues
Summer-Climb Views
Summult-Time Hues