A316272 A fractal-like sequence: erasing all pairs of consecutive terms that include a prime and a composite number (in any order) leaves the sequence unchanged.
1, 2, 3, 4, 1, 6, 5, 2, 3, 7, 8, 4, 1, 6, 9, 11, 5, 2, 3, 7, 13, 10, 8, 4, 1, 6, 9, 12, 17, 11, 5, 2, 3, 7, 13, 19, 14, 10, 8, 4, 1, 6, 9, 12, 15, 23, 17, 11, 5, 2, 3, 7, 13, 19, 29, 16, 14, 10, 8, 4, 1, 6, 9, 12, 15, 18, 31, 23, 17, 11, 5, 2, 3, 7, 13, 19, 29, 37, 20, 16, 14, 10, 8, 4, 1
Offset: 1
Examples
Parentheses are added around each pair of terms made of a composite and a prime number (in any order): (1,2),(3,4),1,(6,5),2,3,(7,8),4,1,6,(9,11),5,2,3,7,(13,10),8,4,1,6,9,(12,17),11,... Erasing all the parenthesized contents yields (...),(...),1,(...),2,3,(...),4,1,6,(....),5,2,3,7,(.....),8,4,1,6,9,(.....),11,... We see that the remaining terms rebuild the starting sequence.
Links
- Eric Angelini, Table of n, a(n) for n = 1..20706
Crossrefs
For other "erasing criteria", see 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), A303954 (pair not summing up to a square).
Comments