|
| |
|
|
A343072
|
|
Irregular triangle read by rows: T(n,k) = 2^(2n+1) * R(n,k), where R(n,k) is the k-th right endpoint after the n-th step of removal in the construction of the Smith-Volterra-Cantor set (SVC).
|
|
2
|
|
|
|
2, 3, 8, 5, 12, 25, 32, 9, 20, 37, 48, 89, 100, 117, 128, 17, 36, 61, 80, 129, 148, 173, 192, 337, 356, 381, 400, 449, 468, 493, 512, 33, 68, 109, 144, 209, 244, 285, 320, 481, 516, 557, 592, 657, 692, 733, 768, 1313, 1348, 1389, 1424, 1489, 1524, 1565, 1600, 1761, 1796, 1837, 1872, 1937, 1972, 2013, 2048
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,1
|
|
|
COMMENTS
|
The SVC (or fat Cantor set) is a subset of [0, 1] similar to the standard Cantor set, constructed as follows:
We start from C_0 = [0, 1], which is written as [0/2, 2/2] for convenience.
- Step 1: Remove the middle open interval of length 1/4 in C_0 (namely (3/8, 5/8)), leaving the union of 2 closed intervals C_1 = [0/8, 3/8] U [5/8, 8/8];
- Step 2: Remove the middle open interval of length 1/4^2 in each of the closed interval of C_1 (namely (5/32, 7/32) and (27/32, 29/32)), leaving the union of 4 closed intervals C_2 = [0/32, 5/32] U [7/32, 12/32] U [20/32, 27/32] U [29/32, 32/32].
...
- Step n: Remove the middle open interval of length 1/4^n in each of the closed interval of C_{n-1}, leaving the union of 4 closed intervals C_n.
The SVC is thereby defined as the intersection of all {C_n} for n >= 0.
After the n-th step, the k-th left closed interval (from left to right) is [L(n,k), R(n,k)] = [A343071(n,k)/2^(2n+1), T(n,k)/2^(2n+1)].
Like the standard Cantor set, the SVC is perfect (i.e., closed and every point inside is an accumulation point of itself) and has empty interior. The difference between the SVC and the standard Cantor set is that the SVC has positive Lebesgue measure, namely 1 - (1/4) - (1/4^2)*2 - (1/4^3)*2^2 - ... = 1/2.
The construction of the famous Volterra's function (a function differentiable everywhere on [0, 1] whose derivative is bounded yet not Riemann integratable) is based on the SVC.
|
|
|
LINKS
|
|
|
|
FORMULA
|
T(n,k) - A343071(n,k) = 2^n + 1, which corresponds to the fact that each closed interval of C_n is of length (2^n + 1)/2^(2n+1).
For n >= 0, 0 <= k <= 2^(n-1) - 1, T(n,2k) = 4*A343071(n-1,k) + (2^n + 1) = 4*T(n,k) - (2^n + 3), T(n,2k+1) = 4*T(n-1,k).
For k = Sum_{i=0..n-1} (b_i) * 2^i, b_i = 0 or 1, T(n,k) = 2^n + 1 + Sum_{i=0..n-1} (b_i) * 4^i * (2^(n-i) + 3).
T(n,k) = 2^(2n+1) - A343071(n,(2^n-1)-k).
|
|
|
EXAMPLE
|
Table begins
2,
3, 8,
5, 12, 25, 32,
9, 20, 37, 48, 89, 100, 117, 128,
17, 36, 61, 80, 129, 148, 173, 192, 337, 356, 381, 400, 449, 468, 493, 512,
33, 68, 109, 144, 209, 244, 285, 320, 481, 516, 557, 592, 657, 692, 733, 768, 1313, 1348, 1389, 1424, 1489, 1524, 1565, 1600, 1761, 1796, 1837, 1872, 1937, 1972, 2013, 2048,
...
After the n-th step of construction, we have
C_0 = [0/2, 2/2],
C_1 = [0/8, 3/8] U [5/8, 8/8],
C_2 = [0/32, 5/32] U [7/32, 12/32] U [20/32, 27/32] U [29/32, 32/32],
C_3 = [0/128, 9/128] U [11/128, 20/128] U [28/128, 37/128] U [39/128, 48/128] U [80/128, 89/128] U [91/128, 100/128] U [108/128, 117/128] U [119/128, 128/128],
...
|
|
|
PROG
|
(PARI) T(n, k) = my(t=2^n+1); for(i=0, n-1, t+=(k%2)*4^i*(2^(n-i)+3); k=k\2); t
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,tabf,easy
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
