A303954 A fractal-like sequence: erasing all pairs of contiguous terms that don't sum up to a square leaves the sequence unchanged.
1, 2, 7, 3, 1, 8, 4, 5, 6, 10, 9, 16, 11, 14, 12, 13, 15, 21, 17, 19, 18, 31, 20, 29, 22, 27, 23, 2, 7, 42, 24, 25, 26, 38, 28, 36, 30, 34, 32, 49, 33, 3, 1, 8, 41, 35, 46, 37, 44, 39, 61, 40, 60, 43, 57, 45, 4, 5, 59, 47, 53, 48, 52, 50, 71, 51, 70, 54, 67
Offset: 1
Examples
Parentheses are added around each pair of terms that don't sum up to a square: (1,2), (7,3), 1, (8,4), (5,6), (10,9), (16,11), (14,12), (13,15), (21,17), (19,18), (31,20), (29,22), (27,23), 2, 7, (42,24), Erasing all the parenthesized contents yields (...), (...), 1, (...), (...), (....), (.....), (.....), (.....), (.....), (.....), (.....), (.....), (.....), 2, 7, (.....), We see that the remaining terms slowly rebuild the starting sequence.
Links
- Lars Blomberg, Table of n, a(n) for n = 1..1000
Crossrefs
Cf. A000290 (Square numbers).
For other "erasing criteria", cf. A303845 (prime by concatenation), A274329 (pair summing up to a prime), A303936 (pair not summing up to a prime), A303948 (pair sharing a digit), A302389 (pair having no digit in common), A303950 (pair summing up to a Fibonacci), A303951 (pair not summing up to a Fibonacci), A303953 (pair summing up to a square).
Comments