OFFSET
1,2
COMMENTS
Start the top of a "pyramid" with an integer w.
Form the lower level by adding w to each digit of w.
Erase any term having one or more duplicates, as well as its duplicates.
Iterate.
All "pyramids" will be blocked at some point, because their lowest level will end up completely erased.
LINKS
Eric Angelini, This is not a fractal pipe, Personal blog of the author.
EXAMPLE
We start the first pyramid with w = 1:
.
1
2
4
8
16
17.22
18.24.24.24
(a triple erasure, 22 will be erased later)
19.26
20.28.28.32
(a double erasure, 20 will be erased later)
22.20.35.34
(we erase now the 22-pair and the 20-pair)
38.40.37.38
(a double erasure again, 40 will be erased at the next step)
44.40.40.44
.
The iteration stops there. w = 1, x = 13 as 13 terms were not erased in the blocked pyramid, y = 12 as the now blocked-pyramid has 12 levels.
Those numbers form the first triple of the sequence {1;13;12}.
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Eric Angelini and Jean-Marc Falcoz, Aug 07 2024
STATUS
approved