A304232 A fractal-like sequence: erasing all pairs of consecutive terms a(n) and a(n+1) having the property that the last digit of a(n) is the same as the first digit of a(n+1) leaves the sequence unchanged.
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 11, 21, 13, 12, 11, 21, 22, 20, 13, 12, 11, 21, 22, 14, 40, 20, 13, 12, 11, 21, 22, 14, 15, 50, 40, 20, 13, 12, 11, 21, 22, 14, 15, 16, 60, 50, 40, 20, 13, 12, 11, 21, 22, 14, 15, 16, 17, 70, 60, 50, 40, 20, 13, 12, 11, 21, 22, 14, 15, 16, 17, 18, 80
Offset: 1
Examples
Parentheses are added around each pair of terms such that the last digit of a(n) is the same as the first digit of a(n+1): 1,2,3,4,5,6,7,8,9,10,(11,12),11,(21,13),12,11,21,(22,20),13,12,11,21,22,(14,40),20,13,12,11,21,22,14,(15,50),40,20, Erasing all the parenthesized contents yields 1,2,3,4,5,6,7,8,9,10,(.....),11,(.....),12,11,21,(.....),13,12,11,21,22,(.....),20,13,12,11,21,22,14,(.....),40,20, We see that the remaining terms slowly rebuild the starting sequence.
Links
- Eric Angelini, Table of n, a(n) for n = 1..585
Comments