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-9 of 9 results.

A356850 a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number not occurring earlier such that a(n) is coprime to the previous Omega(a(n)) terms.

Original entry on oeis.org

1, 2, 3, 5, 4, 7, 9, 10, 11, 13, 6, 17, 19, 14, 15, 23, 22, 21, 25, 26, 29, 27, 31, 8, 33, 35, 34, 37, 39, 38, 41, 43, 45, 28, 47, 51, 46, 49, 53, 55, 12, 59, 61, 57, 20, 67, 69, 58, 65, 71, 62, 63, 73, 74, 77, 75, 79, 52, 83, 85, 81, 44, 89, 87, 82, 91, 93, 86, 95, 97, 94, 99, 101, 103, 50, 107
Offset: 1

Views

Author

Scott R. Shannon, Aug 31 2022

Keywords

Comments

The terms are concentrated along lines that contain numbers with a lowest prime factor of 2 or 3. Two of these lines are initially separated but join after approximately 130000 terms. This combined line then joins the uppermost line, which contains numbers with all prime factors and has a gradient of ~1.59, after approximately 680000 terms at which point a new series of smaller values appears. See the linked images.
Numbers with a larger number of prime divisors relative to the numbers close to it appear much later in the sequence. For example a(4014) = 16, a(14219) = 40, while even more delayed are a(685301) = 24 and a(704634) = 36. These last two appear after the above mentioned line merging after 680000 terms.
The lower lines containing terms with prime factors of 2 and 3 visible in the image of terms up to 1000000 are curving upward, possibly repeating the earlier behavior seen where similar lines eventually join with the uppermost line. If these do in fact eventually reach the uppermost line it is plausible this will once again signal the start of a new series of much lower valued terms.
The two lowest unseen numbers after 1000000 terms are 32 and 48, for former indicating that the longest run of consecutive odd values is only four after 1000000 terms. Although the sequence is conjectured to be a permutation of the positive integers, if these missing terms, especially those of the form 2^k, only appear after the recombination of the lower lines with the upper line then it may take an extraordinarily large number of terms for some values, like 2^k for large k, to eventually appear.
In the first 1000000 terms the only fixed points are the first three terms along with 14 and 15. It is possible more exist if the above mentioned upward trend of smaller values does occur.

Examples

			a(7) = 9 as Omega(9) = A001222(9) = 2, and 9 is coprime to the previous two terms, namely a(6) = 7 and a(5) = 4.
		

Crossrefs

Programs

A356903 a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number not occurring earlier such that a(n) is coprime to the previous tau(a(n)) terms.

Original entry on oeis.org

1, 2, 3, 5, 7, 4, 9, 11, 13, 17, 8, 15, 19, 23, 29, 14, 25, 27, 31, 37, 22, 35, 39, 41, 43, 34, 47, 21, 53, 55, 26, 49, 51, 59, 61, 10, 67, 33, 71, 73, 38, 65, 69, 77, 79, 58, 83, 57, 85, 89, 46, 91, 87, 95, 97, 62, 101, 103, 81, 107, 74, 109, 113, 93, 115, 82, 119, 121, 111, 125, 86, 127, 131, 123
Offset: 1

Views

Author

Scott R. Shannon, Sep 03 2022

Keywords

Comments

The terms are concentrated along various lines that contain numbers with a lowest prime factor of 2, 3 or 5. These lines appear to have a slight upward curvature. However the uppermost line, which has a gradient of ~1.22, contains numbers with all prime factors. See the linked images.
Numbers with a large number of divisors relative to the numbers close to it appear much later in the sequence. For example a(96) = 6, a(1873) = 12, a(2328) = 18, a(192) = 16. The sequence is conjectured to be a permutation of the positive integers although it may take a very large number of terms for some values to appear, e.g., after 500000 terms numbers such as 24, 30, 36 have not occurred. In the same range the longest run of consecutive odd values is seven, while the only fixed points are the first three terms, although it is possible others exist for very large values of n if the smaller terms continue to increase relative to the uppermost line.

Examples

			a(7) = 9 as tau(9) = A000005(9) = 3, and 9 is coprime to the previous three terms, namely a(6) = 4, a(5) = 7 and a(4) = 5.
		

Crossrefs

A358082 a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number not occurring earlier that shares a factor with Sum_{k=1..n-1} sigma(a(k)).

Original entry on oeis.org

1, 2, 4, 11, 23, 47, 5, 101, 7, 211, 3, 14, 22, 487, 6, 9, 8, 10, 1033, 12, 15, 13, 18, 16, 2203, 21, 46, 26, 29, 4583, 89, 9257, 20, 28, 35, 18661, 24, 17, 27, 37441, 30, 19, 25, 32, 33, 36, 34, 38, 39, 40, 42, 44, 45, 48, 37, 31, 50, 49, 52, 54, 56, 58, 60, 62, 63, 51, 57, 64, 55, 66, 69, 72
Offset: 1

Views

Author

Scott R. Shannon, Nov 02 2022

Keywords

Comments

The sequence shows large jumps in value due to the sum occasionally forming a large prime, e.g., a(279) = 2650277753. The sequence is conjectured to be a permutation of the positive integers.

Examples

			a(7) = 5 as Sum_{k=1..6} sigma(a(k)) = Sum_{k=1..6} A000203(a(k)) = 1 + 3 + 7 + 12 + 24 + 48 = 95, and 5 is the smallest unused number that shares a factor with 95.
		

Crossrefs

A358176 a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number not occurring earlier that shares a factor with sigma(a(n-1)).

Original entry on oeis.org

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

Views

Author

Scott R. Shannon, Nov 02 2022

Keywords

Comments

The sequence is conjectured to be a permutation of the positive integers. In the first 500000 terms the fixed points are 1, 2, 3, 4, 6, 9, 12. It is unlikely more exist although this is unknown.

Examples

			a(8) = 5 as a(7) = 8 and sigma(8) = A000203(8) = 15, and 5 is the smallest unused number that shares a factor with 15.
		

Crossrefs

Programs

A358201 a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number not occurring earlier that shares a factor with sigma(max_{k=1..n-1}a(k)).

Original entry on oeis.org

1, 2, 3, 4, 7, 6, 8, 5, 9, 13, 10, 12, 14, 15, 16, 31, 18, 20, 22, 24, 26, 28, 30, 32, 21, 27, 33, 34, 36, 35, 39, 38, 40, 25, 42, 44, 45, 46, 48, 50, 51, 52, 49, 54, 55, 56, 57, 58, 60, 62, 63, 64, 127, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108
Offset: 1

Views

Author

Scott R. Shannon, Nov 03 2022

Keywords

Comments

The sequence is conjectured to be a permutation of the positive integers. In the first 150000 terms the fixed points are 1, 2, 3, 4, 6, 9, 12, 93, 6003, 6881, 16269, 100707, 114839, 116999. It is likely more exist.

Examples

			a(9) = 9 as sigma(max_{k=1..8}a(k)) = sigma(8) = A000203(8) = 15, and 9 is the smallest unused number that shares a factor with 15.
		

Crossrefs

A358208 a(1) = 1; a(2) = 2; a(3) = 3; for n > 3, a(n) is the smallest positive number not occurring earlier that shares a factor with Sum_{k=1..n-1} A001065(k), where A001065(k) is the sum of the proper divisors of k.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 8, 13, 10, 9, 12, 11, 7, 14, 15, 18, 16, 17, 20, 107, 21, 22, 24, 25, 191, 197, 27, 26, 28, 30, 33, 32, 35, 34, 36, 29, 38, 433, 39, 40, 42, 523, 577, 44, 45, 31, 677, 46, 48, 50, 23, 49, 52, 51, 54, 56, 55, 63, 43, 58, 37, 57, 53, 60, 66, 61, 62, 70, 68, 64, 65, 69, 71, 75, 80
Offset: 1

Views

Author

Scott R. Shannon, Nov 04 2022

Keywords

Comments

The majority of terms are concentrated just below the line a(n) = n. However, some terms are much larger because the sum of the proper divisors of all previous terms is a prime number. In the first 10000 terms there are twenty-eight fixed points: 4, 5, 6, ..., 2486, 3280, 3292.
Conjecture: the sequence is a permutation of the positive integers.

Examples

			a(7) = 8 as Sum_{k=1..6} A001065(k) = 0 + 1 + 1 + 3 + 1 + 6 = 12, and 8 is the smallest unused number that shares a factor with 12.
		

Crossrefs

A358209 a(1) = 1; a(2) = 2; for n > 2, a(n) is the smallest positive number not occurring earlier that shares a factor with A024916(n-1) = Sum_{k=1..n-1} sigma(k).

Original entry on oeis.org

1, 2, 4, 6, 3, 7, 9, 41, 8, 12, 15, 11, 127, 18, 5, 14, 10, 16, 277, 21, 24, 28, 22, 431, 491, 20, 26, 30, 25, 23, 27, 32, 857, 35, 42, 19, 33, 34, 13, 36, 38, 40, 37, 39, 44, 45, 46, 43, 48, 1987, 50, 52, 51, 54, 56, 57, 58, 60, 49, 62, 55, 64, 61, 63, 82, 66, 3631, 69, 17, 72, 65, 70, 68, 74
Offset: 1

Views

Author

Scott R. Shannon, Nov 04 2022

Keywords

Comments

The majority of terms are concentrated just below the line a(n) = n. However, some terms are much larger because the sum of the divisors of all previous terms is a prime number. In the first 5000 terms there are thirteen fixed points: 32, 52, 54, ..., 1331, 2082, 2097.
Conjecture: the sequence is a permutation of the positive integers.

Examples

			a(5) = 3 as sigma(1) + sigma(2) + sigma(3) + sigma(4) = A024916(4) = 15, and 3 is the smallest unused number that shares a factor with 15.
		

Crossrefs

A358277 a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number not occurring earlier such that a(n) is coprime to the previous Omega(a(n-1)) terms.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 11, 9, 10, 13, 12, 17, 14, 15, 19, 16, 23, 18, 25, 29, 20, 21, 31, 22, 27, 35, 26, 33, 37, 24, 41, 28, 43, 30, 47, 32, 53, 34, 39, 49, 38, 45, 59, 36, 61, 40, 67, 42, 71, 44, 65, 51, 46, 55, 57, 52, 73, 48, 79, 50, 77, 69, 58, 83, 54, 85, 89, 56, 97, 60, 101, 62, 63, 95
Offset: 1

Views

Author

Scott R. Shannon, Nov 08 2022

Keywords

Comments

Unlike A356850 all the terms are concentrated along three straight lines. In the first 100000 terms there are ten fixed points, 1, 2, 3, ..., 27, 57, and it is likely no more exist. The sequence is conjectured to be a permutation of the positive integers.

Examples

			a(4) = 4 as a(3) = 3 and Omega(3) = A001222(3) = 1, and 4 is coprime to the previous one term, namely a(3) = 3.
a(9) = 11 as a(8) = 8 and Omega(8) = A001222(8) = 3, and 11 is coprime to the previous three terms, namely 8, 7, 6.
		

Crossrefs

Programs

A358175 a(1) = 1, a(2) = 2; a(3) = 3; for n > 3, a(n) is the smallest positive number not occurring earlier that shares a factor with Sum_{k=1..n-1} A001065(a(k)), where A001065(m) is the sum of the proper divisors of m.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 8, 19, 10, 7, 29, 9, 12, 14, 15, 18, 16, 20, 127, 22, 24, 26, 28, 21, 233, 13, 25, 241, 11, 27, 30, 32, 35, 33, 17, 34, 36, 433, 31, 39, 38, 40, 42, 44, 45, 48, 727, 46, 50, 797, 49, 52, 51, 54, 57, 37, 60, 56, 55, 58, 62, 63, 1259, 64, 66, 69, 68, 70, 65, 1579, 72, 78, 77, 74
Offset: 1

Views

Author

Scott R. Shannon, Nov 02 2022

Keywords

Comments

The sequence is conjectured to be a permutation of the positive integers. In the first 10000 terms, other than the first three terms, there are thirty-five fixed points, the last being 2051. It is plausible no more exist although this is unknown.

Examples

			a(9) = 10 as Sum_{k=1..8} A001065(a(k)) = 0 + 1 + 1 + 3 + 1 + 6 + 7 + 1 = 20, and 10 is the smallest unused number that shares a factor with 20.
		

Crossrefs

Showing 1-9 of 9 results.