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

A263648 a(1)=4, a(2)=9: a(n) is the smallest semiprime not yet appearing in the sequence which is coprime to a(n-1) and not coprime to a(n-2).

Original entry on oeis.org

4, 9, 10, 21, 22, 15, 14, 25, 6, 35, 26, 49, 34, 77, 38, 33, 46, 39, 58, 51, 62, 57, 74, 69, 82, 87, 86, 93, 94, 111, 106, 123, 118, 129, 122, 141, 134, 159, 142, 177, 146, 183, 158, 201, 166, 213, 178, 219, 194, 237, 202, 249, 206, 267, 214, 291, 218, 303, 226, 309
Offset: 1

Views

Author

Bob Selcoe, Oct 22 2015

Keywords

Comments

Contrary to what might be expected (see comment after Proof), a(n) is not a permutation of all semiprimes; it is a permutation of even semiprimes {S_2} and semiprimes with smallest factor 3 {S_3}, plus {25, 35, 49, 77}. Proof (Start):
i. The sequence is infinite: we can always consider p*q for a(n+1), where p is the smallest factor in a(n-1) and q is the smallest prime > than the largest factor of any term already appearing in the sequence;
ii. a(15)=38 = 2*19 = 2*prime(8) and a(16)=33 = 3*11 = 3*prime(5);
iii. all {S_2} <= 38 and {S_3} <= 33 have appeared up to a(16), with 38 and 33 being maximum terms in {S_2} and {S_3}, respectively;
iv. all semiprimes with smallest factor >= 5 which are < 2*prime(9)=46 and 3*prime(6)=39 have appeared up to a(16). Consequently, the terms starting at a(17)=46 alternate between 2*prime(k) and 3*prime(k-3) k=9..infinity.
v. the only other numbers to have appeared are {25, 35, 49, 77}.
(End)
The above behavior is in contrast to A119718 (a permutation of all semiprimes because it lacks the constraint of a(n) being not coprime to a(n-2)). Interestingly, this sequence (A263648) shares the same essential rules as A098550 (the Yellowstone permutation) and many of its variations, while A119718 does not; one therefore might expect the opposite behavior to occur between this sequence and A119718. What observations or generalizations might we draw from this?

Crossrefs

Cf. A098550, A119718, A000040 (primes), A100484 (even semiprimes), A001748 (essentially, semiprimes with smallest factor 3).

Programs

Formula

For n >= 15:
a(n) = 2*prime((n+1)/2) when n is odd;
a(n) = 3*prime(n/2-3) when n is even.

Extensions

More terms from Jean-François Alcover, Oct 06 2018

A263650 A variation on A098550 (the Yellowstone permutation): a(n)=n for 1 <= n <= 3, a(4)=5; otherwise a(n) = smallest number not yet appearing in the sequence which is coprime to a(n-1) and not coprime to a(n-2).

Original entry on oeis.org

1, 2, 3, 5, 6, 25, 4, 15, 8, 9, 10, 21, 16, 7, 12, 35, 18, 49, 20, 63, 22, 27, 11, 24, 55, 14, 33, 26, 45, 13, 30, 91, 32, 39, 28, 51, 38, 17, 19, 34, 57, 40, 69, 44, 23, 36, 115, 42, 65, 46, 75, 52, 81, 50, 87, 56, 29, 48, 145, 54, 85, 58, 95, 62, 105, 31, 60, 217, 64
Offset: 1

Views

Author

Bob Selcoe, Oct 22 2015

Keywords

Comments

Proof that this is a permutation of the natural numbers follows the same basic format as the proof contained in A098550.
This sequence is one in a multitude of permutations of definable infinite sets (i.e., "infinite permutations") which share similar properties and similar proofs as A098550 (Yellowstone-type), and which are often (though not always - see for example A119718 and A255582) of the general form: a(n) is smallest number not yet appearing in the sequence which is coprime to a(n-1) and not coprime to a(n-2). But caution is warranted here: many sequences which may appear at first glance to be Yellowstone-type infinite permutations are not (e.g., A263648 is infinite, similar in structure to A119718 and even MORE similar to the general Yellowstone form, yet is not a permutation) or may not be provable in similar fashion (e.g., A254077, which is similar in structure to A255582 but cannot be demonstrated as infinite using Yellowstone-type constructions). What observations or generalizations might we draw from this?

Crossrefs

Programs

  • Mathematica
    a[n_] := a[n] = If[n <= 4, {1, 2, 3, 5}[[n]], For[k = 4, True, k++, If[CoprimeQ[k, a[n-1]] && !CoprimeQ[k, a[n-2]], If[FreeQ[Array[a, n-1], k], Return[k]]]]]; Array[a, 100] (* Jean-François Alcover, Feb 11 2019 *)

Extensions

Corrected and extended by Jean-François Alcover, Feb 11 2019
Showing 1-2 of 2 results.