A335973 -id:A335973 - cp's OEIS frontend

A335972 The Locomotive Pushing the Wagons to the Right sequence (see Comments lines for definition).

2, 13, 14, 15, 16, 17, 18, 91, 201, 202, 31, 203, 24, 25, 26, 27, 28, 92, 41, 204, 35, 36, 37, 38, 93, 42, 51, 205, 46, 47, 48, 94, 52, 61, 206, 57, 58, 95, 62, 71, 207, 68, 96, 72, 81, 208, 97, 82, 131, 301, 302, 132, 133, 141, 303, 142, 134, 53, 143, 144, 63, 145, 64, 73, 146, 74

Offset: 1

Eric Angelini and Carole Dubois, Jul 03 2020

a(1) is the (pushing) locomotive; a(2), a(3), a(4),... a(n),... are the wagons. To hook a wagon to its successor (on the right) you must be able to insert the rightmost digit of a(n) between the first two digits of a(n+1). In mathematical terms, the value of the rightmost digit of a(n) must be between (not equal to) the first and the second digit of a(n+1). This is the lexicographically earliest sequence of distinct positive terms with this property.

a(n) cannot end in 0 or 9. - Michael S. Branicky, Dec 14 2020

			The sequence starts with 2, 13, 14, 15, 16, 17, 18, 91, 201, 202,...
a(1) = 2 as there is no earliest possible (pushing to the right) locomotive;
a(2) = 13 starts with 1 and 3: now 1 < 2 < 3 [2 being the rightmost digit of a(1)];
a(3) = 14 starts with 1 and 4: now 1 < 3 < 4 [3 being the rightmost digit of a(2)];
a(4) = 15 starts with 1 and 5: now 1 < 4 < 5 [4 being the rightmost digit of a(3)];
(...)
a(8) = 91 starts with 9 and 1: now 9 > 8 > 1 [8 being the rightmost digit of a(7)];
a(9) = 201 starts with 2 and 0: now 2 > 1 > 0 [1 being the rightmost digit of a(8)];
a(10) = 202 starts with 2 and 0: now 2 > 1 > 0 [1 being the rightmost digit of a(9)]; etc.

Carole Dubois, Table of n, a(n) for n = 1..5001

Cf. A335971 (locomotive pulling to the left) and A335973 (two locomotives).

def dead_end(k): return k%10 in {0, 9}
def aupto(n, seed=2):
  train, used = [seed], {seed}
  for n in range(2, n+1):
    caboose = train[-1]
    hook = caboose % 10
    low2, high2 = 10 + (hook + 1), 90 + (hook - 1)
    an, pow10b = low2, 1
    while an in used or dead_end(an): an += 1
    first2 = an//pow10b
    a2, b2 = divmod(first2, 10)
    while True:
      if a2 < hook < b2 or a2 > hook > b2:
        train.append(an)
        used.add(an)
        break
      if first2 > high2:
        pow10b *= 10
        an = low2*pow10b
      else:
        an += pow10b
        an -= an%pow10b
      while an in used or dead_end(an): an += 1
      first2 = an//pow10b
      a2, b2 = divmod(first2, 10)
  return train    # use train[n-1] for a(n)
print(aupto(66))  # Michael S. Branicky, Dec 14 2020

A335971 The Locomotive Pulling the Wagons to the Left sequence (see Comments lines for definition).

Original entry on oeis.org

13, 20, 14, 24, 30, 15, 25, 31, 26, 35, 40, 16, 27, 36, 41, 28, 37, 42, 38, 46, 50, 17, 29, 39, 47, 51, 48, 52, 49, 53, 402, 18, 57, 60, 19, 58, 61, 59, 62, 302, 102, 103, 104, 105, 106, 107, 63, 403, 108, 64, 502, 109, 68, 70, 69, 71, 202, 113, 203, 114, 204, 115, 205, 116, 206

Offset: 1

Eric Angelini and Carole Dubois, Jul 03 2020

a(1) is the locomotive; a(2), a(3), a(4),... a(n),... are the successive wagons. To hook a wagon to its predecessor (on the left) you must be able to insert the leftmost digit of a(n) between the last two digits of a(n-1). In mathematical terms, the value of the leftmost digit of a(n) must be between (not equal to) the penultimate and the last digit of a(n-1). This is the lexicographically earliest sequence of distinct positive terms with this property.

			The sequence starts with 13, 20, 14, 24, 30,...
a(1) = 13 as there is no earliest possible (pulling to the left) locomotive;
a(2) = 20 starts with 2 and 1 < 2 < 3 [1 and 3 being the last two digits of a(1)];
a(3) = 14 starts with 1 and 2 > 1 > 0 [2 and 0 being the last two digits of a(2)];
a(4) = 24 starts with 2 and 1 < 2 < 4 [1 and 4 being the last two digits of a(3)]; etc.

Carole Dubois, Table of n, a(n) for n = 1..5001

Cf. A335972 (locomotive pushing to the right) and A335973 (two locomotives).

def dead_end(k): return abs((k//10)%10 - k%10) <= 1
def aupto(n, seed=13):
  train, used = [seed], {seed}
  for n in range(2, n+1):
    caboose = train[-1]
    h1, h2 = sorted([(caboose//10)%10, caboose%10])
    hooks = set(range(h1+1, h2))
    pow10 = 10
    an = min(hooks)*pow10
    while an in used: an += 1
    hook = an//pow10
    while True:
      if hook in hooks:
        if not dead_end(an):
          train.append(an)
          used.add(an)
          break
      else: pow10 *= 10
      an = max(an+1, min(hooks)*pow10)
      while an in used: an += 1
      hook = an//pow10
  return train    # use train[n-1] for a(n)
print(aupto(65))  # Michael S. Branicky, Dec 14 2020

A339467 The Ronnie O'Sullivan's "infinite plant" sequence: nonprime numbers become prime numbers by striking the cue ball 1 with a cue stick to the right (see the Comments section).

Original entry on oeis.org

1, 12, 4, 14, 15, 6, 16, 18, 32, 8, 33, 9, 72, 34, 35, 36, 74, 38, 39, 75, 91, 76, 77, 92, 93, 78, 94, 192, 95, 96, 132, 98, 99, 111, 133, 112, 114, 194, 195, 212, 115, 213, 116, 134, 196, 135, 214, 198, 117, 272, 118, 119, 291, 136, 138, 215, 216, 171, 273, 172, 231, 274, 217, 275, 218, 219, 292, 232, 234, 312, 235

Offset: 1

Eric Angelini and Carole Dubois, Dec 06 2020

There is a non-snooker description of this sequence: first erase all spaces between terms; then move every comma 1 position to the left; the new sequence is now made by primes only (with duplicates, sometimes); the starting sequence (this one) is the lexicographically earliest with this property that has no duplicates and no primes.

			Striking 1 to the right pushes 1 against 12;
the last digit of 12 is then pushed against 4 (leaving 11 behind - a prime);
the last digit of 4 is then pushed against 14 (leaving 2 behind - a prime);
the last digit of 14 is then pushed against 15 (leaving 41 behind - a prime);
the last digit of 15 is then pushed against 6 (leaving 41 behind - a prime);
the last digit of 6 is then pushed against 16 (leaving 5 behind - a prime); etc.
This is the lexicographically earliest sequence of distinct positive terms with this property

Carole Dubois, Table of n, a(n) for n = 1..5000

Cf. A339616 (the Judd Trump sequence), A335972, A335973.

from sympy import isprime
def aupto(n):
    alst, used = [0, 1], {1}
    for k in range(2, n+1):
        ball = (str(alst[k-1]))[-1]
        ak = 1
        ball_left = ball + (str(ak))[:-1]
        while not isprime(int(ball_left)) or ak in used or isprime(ak):
            ak += 1 + (ak%10 == 9)  # can't end in 0
            ball_left = ball + (str(ak))[:-1]
        alst.append(ak)
        used.add(ak)
    return alst[1:]  # use alst[n] for a(n) function
print(aupto(64))  # Michael S. Branicky, Dec 07 2020

cp's OEIS Frontend

A335972 The Locomotive Pushing the Wagons to the Right sequence (see Comments lines for definition).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

A335971 The Locomotive Pulling the Wagons to the Left sequence (see Comments lines for definition).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

A339467 The Ronnie O'Sullivan's "infinite plant" sequence: nonprime numbers become prime numbers by striking the cue ball 1 with a cue stick to the right (see the Comments section).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python