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

A363011 Indices of record highs in A362816.

Original entry on oeis.org

1, 3, 9, 57, 504, 3847, 41170
Offset: 1

Views

Author

Samuel Harkness, May 12 2023

Keywords

Comments

It is conjectured that only terms in A362815 appear in A362816, and novel terms in A362816 seen to be in ascending order. Does every term in A362815 appear in A362816?
If the conjecture is true and novel terms are in ascending order, then these are the smallest k such that A362816(k) = A362815(n).

Examples

			Cf. A362815, A362816.
		

Crossrefs

Programs

  • MATLAB
    See Links section.

A364057 Lexicographically earliest infinite sequence of positive integers such that every subsequence {a(j), a(j+k), a(j+2k)} (j, k >= 1) is unique.

Original entry on oeis.org

1, 1, 1, 2, 3, 1, 2, 4, 5, 6, 7, 8, 5, 1, 2, 9, 3, 4, 6, 7, 1, 10, 11, 12, 13, 8, 14, 15, 16, 3, 17, 9, 18, 4, 7, 19, 5, 2, 11, 12, 20, 6, 1, 8, 21, 22, 9, 23, 24, 13, 14, 3, 10, 16, 17, 25, 26, 19, 27, 6, 28, 11, 15, 20, 22, 29, 12, 21, 16, 23, 30, 18, 31, 32
Offset: 1

Views

Author

Samuel Harkness, Oct 19 2023

Keywords

Comments

To find a(n), two criteria must be satisfied:
1. Every subsequence {a(n-2k), a(n-k) a(n)} created by a(n) must be unique.
2. a(n) cannot create the scenario where a future a(m) will create multiple {a(m-2k), a(m-k), a(m)} regardless of choice for a(m). The first time this is the sole reason a candidate is denied is at a(10), see Example below.
Will every subsequence of 3 positive integers appear in arithmetic progression in this sequence?
Will every positive integer occur infinitely many times?
For n >= 3, a(n) != a(n+1).
In the 74 initially published terms, numbers on average seem to reoccur at (very) roughly twice the index of their previous occurrence. This seems worthy of better quantification when further terms are established. - Peter Munn, Nov 03 2023

Examples

			For a(9), we first try 1. If a(9) were 1, {a(3), a(6), a(9)} would be {1, 1, 1}, but this already occurred at {a(1), a(2), a(3)}.
Next, try 2. If a(9) were 2, {a(3), a(6), a(9)} would be {1, 1, 2}, but this already occurred at {a(2), a(3), a(4)}.
Next, try 3. If a(9) were 3, {a(3), a(6), a(9)} would be {1, 1, 3}, but this already occurred at {a(1), a(3), a(5)}.
Next, try 4. If a(9) were 4, {a(1), a(5), a(9)} would be {1, 3, 4}, but this already occurred at {a(2), a(5), a(8)}.
Then, try 5. New subsequences at indices {a(1), a(5), a(9)} = {1, 3, 5}, {a(3), a(6), a(9)} = {1, 1, 5}, {a(5), a(7), a(9)} = {3, 2, 5}, and {a(7), a(8), a(9)} = {2, 4, 5} are formed, none of which have occurred at any {a(j), a(j+k), a(j+2k)} (for any j and k) previously. No 5 has occurred previously, so criteria (2) in Comments must be satisfied. Thus a(9) = 5.
a(10) is the first time a candidate is denied solely because it would create a guaranteed future duplicate. Note that no subsequences prevent a(10) from being 4.
n    = 1  2  3  4  5  6  7  8  9 10 11 12 13 14
a(n) = 1  1  1  2  3  1  2  4  5 [4]          X
                      |           |           |
          |                 |                 |
If a(10) were 4, {a(2), a(8), a(14)} = {a(6), a(10), a(14)} = {1, 4, X}, making a subsequence {a(j), a(j+k), a(j+2k)} which is not unique. Therefore a(10) != 4.
		

Crossrefs

Programs

  • MATLAB
    See Links section.
    (C++) See Links section.

A362815 Start with 2. Then, numbers are added to the sequence if they do not form any arithmetic progression p with numbers in the sequence such that length(p) > min(p).

Original entry on oeis.org

2, 3, 5, 6, 7, 11, 13, 14, 16, 17, 18, 19, 21, 22, 23, 25, 28, 29, 31, 37, 38, 39, 41, 43, 46, 47, 50, 51, 52, 53, 55, 58, 59, 61, 62, 64, 66, 67, 68, 70, 71, 73, 75, 77, 79, 82, 83, 85, 86, 88, 89, 93, 94, 96, 97, 99, 101, 103, 106, 107, 109, 110, 113, 115
Offset: 1

Views

Author

Samuel Harkness, May 04 2023

Keywords

Comments

All primes are in the sequence.
Does the density of numbers in this sequence approach 0.5?

Examples

			2 is in the sequence.
For 3: the only arithmetic progression made with 3 is p = {2,3}. Here, length(p) = min(p), so 3 is a term.
For 4: p = {2,3,4} can be made. Here, length(p) > min(p), so 4 is not a term.
For 5: the only arithmetic progressions made with 5 are p = {2,5} and p = {3,5}. Neither of these have length(p) > min(p), so 5 is a term.
...
For 9: p = {3,5,7,9} can be made. Here, length(p) > min(p), so 9 is not a term.
		

Crossrefs

Programs

  • MATLAB
    See Links section.
Showing 1-3 of 3 results.