cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-4 of 4 results.

A351625 a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number that has not appeared that shares a factor with the largest previous term.

Original entry on oeis.org

1, 2, 4, 6, 3, 8, 10, 5, 12, 9, 14, 7, 16, 18, 15, 20, 22, 11, 24, 21, 26, 13, 28, 30, 25, 27, 32, 34, 17, 36, 33, 38, 19, 40, 35, 42, 39, 44, 46, 23, 48, 45, 50, 52, 54, 51, 56, 49, 58, 29, 60, 55, 57, 62, 31, 64, 66, 63, 68, 70, 65, 72, 69, 74, 37, 76, 78, 75, 80, 82, 41, 84, 77, 81, 86, 43, 88
Offset: 1

Views

Author

Scott R. Shannon, May 04 2022

Keywords

Comments

The sequence differs from A352976 after twenty-six terms. See the examples below.
In the first 100000 terms the maximum run of even and odd terms is three and five respectively; it is unknown if these runs have a maximum number of terms or are unbounded. The fixed points beyond 2 are 15, 25, 35, and it is likely no more exist. The primes appear in their natural order, and it is conjectured that this is a permutation of the positive integers.
From Michael De Vlieger, May 08 2022: (Start)
Let u be the smallest missing number in a(1..n-1) and let record r = max(a(1..n-1)).
Theorem: For odd prime q, r = mq -> q. Proof: generally, q may either divide or be coprime to r, but since equality and coprimality are prohibited by definition, primes may only divide records. This implies q serves as local minima, hence u > 2 is always an odd prime and r > 1 is always even.
Since r is always even, r is nondecreasing and even numbers appear in natural order. Also, r = 2q -> q, similar to the Lagarias-Rains-Sloane chain in the EKG sequence but without the successor 3q.
Theorem: a(n) = k such that k is odd iff least prime factor q | k and q | r. Proof: sequence definition demands smallest missing number such that (r,k) > 1. Otherwise, a(n) = a(n-1) + 2, since (a(n-1), a(n-1) + 2) > 1, and all smaller even numbers have already appeared.
All even numbers and primes appear, and every odd composite k has a least prime factor that admits k into the sequence on the occasion of (r,k) > 1.
There are 3 trajectories in scatterplot for a(n) > 1. The trajectory with lowest apparent slope is that of the primes, i.e., local minima. The trajectory with highest slope is that of records, i.e., even numbers, and the remaining numbers are odd composites. (End)

Examples

			a(6) = 8 as the largest value of all previous terms is a(4) = 6, and 8 is the smallest unused number that shares a factor with 6.
a(27) = 32 as the largest value of all previous terms is a(24) = 30, and 32 is the smallest unused number that shares a factor with 30. Note that A352976(27) = 33 as it must share a factor with max(25,27) = 27.
		

Crossrefs

Programs

A351626 a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number that has not appeared that shares a factor with both the largest and second largest value of all previous terms.

Original entry on oeis.org

1, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 15, 22, 24, 26, 28, 30, 21, 32, 34, 36, 38, 40, 42, 35, 44, 33, 46, 48, 50, 45, 52, 54, 39, 56, 58, 60, 62, 64, 66, 68, 51, 70, 72, 63, 74, 76, 78, 57, 80, 65, 75, 82, 84, 86, 88, 90, 55, 92, 69, 94, 96, 98, 100, 102, 85, 104, 106, 108, 110, 99, 105, 112, 77
Offset: 1

Views

Author

Scott R. Shannon, May 04 2022

Keywords

Comments

The sequence contains no primes or prime powers other than the powers of 2. As the sequence starts with 2 and 4, these terms being the largest and second largest values, the following terms will be even. This pattern continues until a term equal to the product of two or more odd primes occurs that shares a factor with the previous two largest even values and is smaller than the largest value plus 2. It is not possible for this value to be a prime larger than 2, or a power of such a prime, as the two terms with which it must share a factor differ by 2. It therefore cannot be between them either so it must be less than the second largest even term. Thus the next term after this odd composite must still share a factor with the two largest even values, and this will be the largest value plus 2 or another smaller odd composite. Therefore two more even values eventually become the two largest terms again, and thus the pattern of the two largest even terms, differing by two, interrupted by odd composites continues. Therefore no primes or prime powers other than powers of 2 will occur.
In the first 200000 terms the maximum run of even and odd terms is twelve and seven respectively; it is unknown if these runs have a maximum number of terms or are unbounded. The fixed points beyond 2 in the same range are 573, 597, 633, 6487, 21865, 22115, although it is likely more exist.

Examples

			a(5) = 8 as the largest and second-largest values of all previous terms are a(4) = 6 and a(3) = 4, and 8 is the smallest unused number that shares a factor with both of these values.
a(12) = 15 as the largest and second-largest values of all previous terms are a(11) = 20 and a(10) = 18, and 15 is the smallest unused number that shares a factor with both of these values.
		

Crossrefs

A352943 a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number that has not appeared that shares a factor with the sum of the largest and second largest value of all previous terms.

Original entry on oeis.org

1, 2, 3, 5, 4, 6, 11, 17, 7, 8, 10, 12, 29, 14, 16, 18, 47, 19, 20, 22, 24, 26, 28, 30, 21, 33, 15, 25, 32, 34, 9, 27, 36, 83, 13, 35, 38, 39, 40, 42, 44, 45, 46, 48, 131, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 43, 55, 65, 75, 85, 51, 57, 63, 69, 81, 86, 31
Offset: 1

Views

Author

Scott R. Shannon, May 06 2022

Keywords

Comments

The sequence contains long runs on even terms, differing by 2, and odd terms, differing by various small even numbers. These runs are often interrupted by a large prime that becomes the new largest term. As this and the previous largest term are typically much larger than any other value the sequence then begins a long series of steadily increasing values that share a factor with the sum of these two largest terms.
The sequence is conjectured to be a permutation of the positive integers, although it apparently takes many terms for some primes to appear, e.g., after 200000 terms 73 has not occurred. The primes do not occur in their natural order. Beyond the first three terms there are nine fixed points in the first 200000 terms, although it is likely more exist.

Examples

			a(4) = 5 as the sum of the largest and second-largest value of all previous terms is a(3) + a(2) = 3 + 2 = 5, and 5 is the smallest unused number that shares a factor with 5.
a(10) = 8 as the sum of the largest and second-largest value of all previous terms is a(8) + a(7) = 17 + 11 = 28, and 8 is the smallest unused number that shares a factor with 28.
		

Crossrefs

Programs

A352968 a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number that has not appeared that shares a factor with min(a(n-2),a(n-1)).

Original entry on oeis.org

1, 2, 3, 4, 6, 8, 9, 10, 12, 5, 15, 20, 18, 14, 7, 21, 28, 24, 16, 22, 26, 11, 33, 44, 27, 30, 36, 25, 35, 40, 42, 32, 34, 38, 17, 51, 68, 39, 13, 52, 65, 46, 23, 69, 92, 45, 48, 50, 54, 55, 56, 60, 49, 63, 70, 57, 19, 76, 95, 58, 29, 87, 116, 66, 62, 31, 93, 124, 72, 64, 74, 78, 37, 111, 148, 75
Offset: 1

Views

Author

Scott R. Shannon, Apr 12 2022

Keywords

Comments

Although all primes likely appear they do not occur in their natural order, e.g., 17 appears before 13. In the range studied each time a prime appears, beyond the initial 2 and 3, the next term is a multiple of the same prime. The largest multiple in the first 500000 terms is eight, first occurring at a(446271) = 64403, a(446272) = 515224. It is unknown if this ratio is unbounded for large n. Similarly the smaller of the two terms before a prime is a multiple of the prime. The largest ratio found being seven, first occurring at a(446271) = 64403, the same term as above.
In the first 500000 terms there are thirty-eight fixed points - 1, 2, 3, 4, 14, 32, 85, ..., 3277, 8651, 9223. It is likely no more exist. The sequence is conjectured to be a permutation of the positive integers.

Examples

			a(4) = 4 as min(a(2),a(3)) = min(2,3) = 2, and 4 is the smallest unused number that shares a factor with 2.
a(5) = 6 as min(a(3),a(4)) = min(3,4) = 3, and 6 is the smallest unused number that shares a factor with 3.
		

Crossrefs

Programs

Showing 1-4 of 4 results.