A302389 -id:A302389 - cp's OEIS frontend

A303936 A fractal-like sequence: erasing all pairs of contiguous terms that do not sum up to a prime leaves the sequence unchanged.

1, 2, 3, 4, 5, 6, 8, 9, 7, 4, 13, 11, 12, 10, 19, 14, 5, 6, 17, 15, 8, 9, 20, 16, 7, 4, 13, 18, 21, 22, 23, 24, 25, 28, 26, 11, 12, 29, 27, 10, 19, 34, 30, 31, 32, 35, 33, 14, 5, 6, 17, 36, 38, 15, 8, 9, 20, 39, 37, 16, 7, 4, 13, 18, 41, 40, 21, 22, 45, 42, 47

Offset: 1

Eric Angelini, May 03 2018

nonn

The sequence is fractal-like as it embeds an infinite number of copies of itself.
The sequence was built according to these rules (see, in the Example section, the parenthesization technique):
  1) no overlapping pairs of parentheses;
  2) always start the content inside a pair of parentheses with the smallest integer X > 3 not yet present inside another pair of parentheses;
  3) always end the content inside a pair of parentheses with the smallest integer Y > 3 not yet present inside another pair of parentheses such that X and Y sum up to a composite number;
  4) after a(1) = 1, a(2) = 2 and a(3) = 3, always try to extend the sequence with a duplicate of the oldest term of the sequence not yet duplicated; if this leads to a contradiction, open a new pair of parentheses.

			Parentheses are added around each pair of terms that don't sum up to a prime:
1, 2, 3, (4,5), (6,8), (9,7), 4, (13,11), (12,10), (19,14), 5, 6, (17,15), 8, 9, (20,16), 7, 4, 13,
Erasing all the parenthesized contents yields
1, 2, 3, (...), (...), (...), 4, (.....), (.....), (.....), 5, 6, (.....), 8, 9, (.....), 7, 4, 13,
We see that the remaining terms slowly rebuild the starting sequence.

Lars Blomberg, Table of n, a(n) for n = 1..1000

For other erasing criteria, cf. A303845 (prime by concatenation), A303948 (pair sharing a digit), A274329 (pair summing up to a prime), A302389 (pair having no digit in common).

A303950 A fractal-like sequence: erasing all pairs of contiguous terms that sum up to a Fibonacci number leaves the sequence unchanged.

Original entry on oeis.org

1, 2, 4, 9, 1, 3, 5, 2, 4, 6, 7, 9, 1, 3, 8, 13, 5, 2, 4, 6, 10, 11, 7, 9, 1, 3, 8, 12, 22, 13, 5, 2, 4, 6, 10, 14, 20, 11, 7, 9, 1, 3, 8, 12, 15, 19, 22, 13, 5, 2, 4, 6, 10, 14, 16, 18, 20, 11, 7, 9, 1, 3, 8, 12, 15, 17, 38, 19, 22, 13, 5, 2, 4, 6, 10, 14, 16

Offset: 1

Eric Angelini and Lars Blomberg, May 03 2018

The sequence is fractal-like as it embeds an infinite number of copies of itself.
The sequence was built according to these rules (see, in the Example section, the parenthesization technique):
  1) no overlapping pairs of parentheses;
  2) always start the content inside a pair of parentheses with the smallest integer F not yet present inside another pair of parentheses;
  3) always end the content inside a pair of parentheses with the smallest integer I not yet present inside another pair of parentheses such that the sum F + I is a Fibonacci number;
  4) after a(2) = 2, always try to extend the sequence with a duplicate of the oldest term of the sequence not yet duplicated; if this leads to a contradiction, open a new pair of parentheses.

			Parentheses are added around each pair of terms that sum up to a Fibonacci:
(1,2), (4,9), 1, (3,5), 2, 4, (6,7), 9, 1, 3, (8,13), 5, 2, 4, 6, (10,11), 7, 9, 1, 3, 8, (12,22), 13, 5, 2, 4, 6, 10, (14,20), 11, ...
Erasing all the parenthesized contents yields
(...), (...), 1, (...), 2, 4, (...), 9, 1, 3, (....), 5, 2, 4, 6, (.....), 7, 9, 1, 3, 8, (.....), 13, 5, 2, 4, 6, 10, (.....), 11, ...
We see that the remaining terms slowly rebuild the starting sequence.

Lars Blomberg, Table of n, a(n) for n = 1..998

Cf. A000045 (Fibonacci 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).

A303951 A fractal-like sequence: erasing all pairs of contiguous terms that don't sum up to a Fibonacci number leaves the sequence unchanged.

Original entry on oeis.org

1, 2, 3, 4, 9, 5, 3, 10, 6, 7, 8, 13, 11, 23, 12, 22, 14, 20, 15, 19, 16, 18, 17, 4, 9, 25, 21, 34, 24, 31, 26, 29, 27, 28, 30, 59, 32, 57, 33, 56, 35, 54, 36, 53, 37, 52, 38, 51, 39, 50, 40, 49, 41, 48, 42, 47, 43, 46, 44, 45, 55, 89, 58, 86, 60, 84, 61, 83

Offset: 1

Lars Blomberg and Eric Angelini, May 03 2018

The sequence is fractal-like as it embeds an infinite number of copies of itself.
The sequence was built according to these rules (see, in the Example section, the parenthesization technique):
  1) no overlapping pairs of parentheses;
  2) always start the content inside a pair of parentheses with the smallest integer C > 2 not yet present inside another pair of parentheses;
  3) always end the content inside a pair of parentheses with the smallest integer I > 2 not yet present inside another pair of parentheses such that the sum C + I is not a Fibonacci number;
  4) after a(1) = 1 and a(2) = 2, always try to extend the sequence with a duplicate of the oldest term of the sequence not yet duplicated; if this leads to a contradiction, open a new pair of parentheses.

			Parentheses are added around each pair of terms that don't sum up to a Fibonacci:
1, 2, (3,4), (9,5), 3, (10,6), (7,8), (13,11), (23,12), (22,14), (20,15), (19,16), (18,17), 4, 9, (25,21), ...
Erasing all the parenthesized contents yields
1, 2, (...), (...), 3, (....), (...), (.....), (.....), (.....), (.....), (.....), (.....), 4, 9, (.....), ...
We see that the remaining terms slowly rebuild the starting sequence.

Lars Blomberg, Table of n, a(n) for n = 1..999

Cf. A000045 (Fibonacci 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).

A303953 A fractal-like sequence: erasing all pairs of contiguous terms that sum up to a square leaves the sequence unchanged.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 10, 4, 7, 9, 5, 6, 8, 17, 10, 4, 7, 11, 14, 9, 5, 6, 8, 12, 13, 17, 10, 4, 7, 11, 15, 21, 14, 9, 5, 6, 8, 12, 16, 20, 13, 17, 10, 4, 7, 11, 15, 18, 31, 21, 14, 9, 5, 6, 8, 12, 16, 19, 30, 20, 13, 17, 10, 4, 7, 11, 15, 18, 22, 27, 31, 21, 14

Offset: 1

Lars Blomberg and Eric Angelini, May 03 2018

The sequence is fractal-like as it embeds an infinite number of copies of itself.
The sequence was built according to these rules (see, in the Example section, the parenthesization technique):
  1) no overlapping pairs of parentheses;
  2) always start the content inside a pair of parentheses with the smallest integer R > 3 not yet present inside another pair of parentheses;
  3) always end the content inside a pair of parentheses with the smallest integer E > 3 not yet present inside another pair of parentheses such that the sum R + E is a square number;
  4) after a(1) = 1, a(2) = 2, a(3) = 3, a(4) = 4 and a(5) = 5, always try to extend the sequence with a duplicate of the oldest term > 5 of the sequence not yet duplicated; if this leads to a contradiction, open a new pair of parentheses.

			Parentheses are added around each pair of terms that sum up to a square:
1, 2, 3, (4,5), (6,10), 4, (7,9), 5, 6, (8,17), 10, 4, 7, (11,14), 9, 5, 6, 8, (12,13), 17, 10,
Erasing all the parenthesized contents yields
1, 2, 3, (...), (....), 4, (...), 5, 6, (....), 10, 4, 7, (.....), 9, 5, 6, 8, (.....), 17, 10,
We see that the remaining terms slowly rebuild the starting sequence.

Lars Blomberg, Table of n, a(n) for n = 1..998

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).

A303954 A fractal-like sequence: erasing all pairs of contiguous terms that don't sum up to a square leaves the sequence unchanged.

Original entry on oeis.org

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

Lars Blomberg and Eric Angelini, May 03 2018

The sequence is fractal-like as it embeds an infinite number of copies of itself.
The sequence was built according to these rules (see, in the Example section, the parenthesization technique):
  1) no overlapping pairs of parentheses;
  2) always start the content inside a pair of parentheses with the smallest integer N not yet present inside another pair of parentheses;
  3) always end the content inside a pair of parentheses with the smallest integer E not yet present inside another pair of parentheses such that the sum N + E is not a square number;
  4) after a(1) = 1 and a(2) = 2, always try to extend the sequence with a duplicate of the oldest term > 5 of the sequence not yet duplicated; if this leads to a contradiction, open a new pair of parentheses.

			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.

Lars Blomberg, Table of n, a(n) for n = 1..1000

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).

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.

Original entry on oeis.org

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

Eric Angelini and Jean-Marc Falcoz, Jun 28 2018

The sequence is fractal-like as it embeds an infinite number of copies of itself.
The sequence was built according to these rules (see, in the Example section, the parenthesization technique):
  1) no overlapping pairs of parentheses;
  2) always start the content inside a pair of parentheses either with the smallest prime P > 2 not yet present inside another pair of parentheses or with the smallest composite C > 1 not yet present inside another pair of parentheses ;
  3) always end the content inside a pair of parentheses either with the smallest composite C > 1 not yet present inside another pair of parentheses or with the smallest prime > 2 not yet present inside another pair of parentheses;
  4) after a(1) = 1 and a(2) = 2, always try to extend the sequence with a duplicate > 1 of the oldest term of the sequence not yet duplicated; if this leads to a contradiction, open a new pair of parentheses.

			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.

Eric Angelini, Table of n, a(n) for n = 1..20706

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).

cp's OEIS Frontend

A303936 A fractal-like sequence: erasing all pairs of contiguous terms that do not sum up to a prime leaves the sequence unchanged.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A303950 A fractal-like sequence: erasing all pairs of contiguous terms that sum up to a Fibonacci number leaves the sequence unchanged.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A303951 A fractal-like sequence: erasing all pairs of contiguous terms that don't sum up to a Fibonacci number leaves the sequence unchanged.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A303953 A fractal-like sequence: erasing all pairs of contiguous terms that sum up to a square leaves the sequence unchanged.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A303954 A fractal-like sequence: erasing all pairs of contiguous terms that don't sum up to a square leaves the sequence unchanged.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

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.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs