A323455 -id:A323455 - cp's OEIS frontend

A323286 Choix de Bruxelles (version 1): irregular table read by rows in which row n lists all the legal numbers that can be reached by halving or doubling some substring of the decimal expansion of n.

2, 1, 4, 6, 2, 8, 10, 3, 12, 14, 4, 16, 18, 5, 20, 12, 21, 22, 6, 11, 14, 22, 24, 16, 23, 26, 7, 12, 18, 24, 28, 25, 30, 110, 8, 13, 26, 32, 112, 27, 34, 114, 9, 14, 28, 36, 116, 29, 38, 118, 10, 40, 11, 22, 41, 42, 11, 12, 21, 24, 42, 44, 13, 26, 43, 46, 12

Offset: 1

N. J. A. Sloane, Jan 14 2019

Take the decimal expansion of n, say n = d_1 d_2 ... d_k. We can choose to map it to any number that can be obtained by the following process. Take any substring d_i, d_{i+1}..., d_j that does not begin with 0. If the number represented by this substring is odd, replace it with twice the number. If it is even either halve it or double it.
The substring may increase or decrease in length. We do not pad it with zeros if it decreases in length.
For example, if n = 20129, then by acting on single-digit substrings we get 10129, 40129, 20229, 20119, 20149, 201218. Acting on 2-digit substrings we get in addition 2069 (halve the 12!), 20249, 20158. From 3-digit substrings we also get 40229, 20258; from 4-digit substrings we get 40249; and from 5-digit substrings we get 40258.
Eric Angelini asks what is the smallest number of steps needed to reach n if we start at 1 and repeatedly apply this process? We can reach 2 in 1 step, 4 in 2 steps, 13 in five steps, and so on.
Lars Blomberg has shown, by considering just the final digit of the numbers in the trajectory, that no number ending in 0 or 5 can be reached from 1. All other numbers can be reached (cf. A323454) - see proof below.
Update, Jan 15 2019: Lorenzo Angelini has found that 3 can be reached from 1 in 11 steps: 1, 2, 4, 8, 16, 112, 56, 28, 14, 12, 6, 3. No shorter path is possible.
From N. J. A. Sloane, Jan 16 2019: (Start)
Theorem: If k > 1 does not end in 0 or 5 then it can be reached from 1.
Proof: Suppose not, and let k be the smallest such number. Note that the allowed operations are invertible: if a -> b then also b -> a. So that means that
*** all the descendants of k must be bigger than k ***
(if there was a descendant < k, then it would also be unreachable from 1, which is a contradiction to k being the smallest).
All digits of k must be odd (if there were an even digit > 0, halve it and get a smaller number; if there is a zero digit, say we see a0, then we halve a0 and get a smaller number).
If all the digits of k are 1, do 111...1 -> 111...2 -> 55..56, a smaller number.
If there is a digit 3, 7, or 9, we know we can get that single digit down to 1 (see A323454), again a contradiction.
But all the digits can't be 5.  QED (End)

			The triangle begins:
   2;
   1,   4;
   6;
   2,   8;
  10;
   3,  12;
  14;
   4,  16;
  18;
   5,  20;
  12,  21,  22;
   6,  11,  14,  22,  24;
  16,  23,  26;
   7,  12,  18,  24,  28;
  25,  30, 110;
   8,  13,  26,  32, 112;
  27,  34, 114;
   9,  14,  28,  36, 116;
  29,  38, 118;
  10,  40;
  11,  22,  41,  42;
  11,  12,  21,  24,  42,  44;
  ...

Eric Angelini, Email to N. J. A. Sloane, Jan 14 2019.

Rémy Sigrist, Rows n = 1..2000, flattened
Eric Angelini, Lars Blomberg, Charlie Neder, Remy Sigrist, and N. J. A. Sloane, "Choix de Bruxelles": A New Operation on Positive Integers, arXiv:1902.01444 [math.NT], Feb 2019; Fib. Quart. 57:3 (2019), 195-200.
Eric Angelini, Lars Blomberg, Charlie Neder, Remy Sigrist, and N. J. A. Sloane,, "Choix de Bruxelles": A New Operation on Positive Integers, Local copy.
Brady Haran and N. J. A. Sloane, The Brussels Choice, Numberphile video (2020)
Rémy Sigrist, PARI program for A323286
N. J. A. Sloane, Coordination Sequences, Planing Numbers, and Other Recent Sequences (II), Experimental Mathematics Seminar, Rutgers University, Jan 31 2019, Part I, Part 2, Slides. (Mentions this sequence)

The number of terms in row n is given by A323287.
See A323460 for the (preferred) version 2 where n can also be mapped to itself.
See also A323288 (row maxima), A323289, A323452, A323453, A323454, A323455 (a binary analog).
For variants of the Choix de Bruxelles operation, see A337321 and A337357.

PARI
```
See Sigrist link.
```

def cdb(n):
    s, out = str(n), set()
    for l in range(1, len(s)+1):
        for i in range(len(s)+1-l):
            if s[i] == '0': continue
            t = int(s[i:i+l])
            out.add(int(s[:i] + str(2*t) + s[i+l:]))
            if t&1 == 0: out.add(int(s[:i] + str(t//2) + s[i+l:]))
    return sorted(out)
print([c for n in range(1, 25) for c in cdb(n)]) # Michael S. Branicky, Jul 24 2022

Data corrected by Rémy Sigrist, Jan 15 2019

A323465 Irregular triangle read by rows: row n lists the numbers that can be obtained from the binary expansion of n by either deleting a single 0, or inserting a single 0 after any 1, or doing nothing.

Original entry on oeis.org

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

Offset: 1

N. J. A. Sloane, Jan 26 2019

All the numbers in row n have the same binary weight (A000120) as n.
If k appears in row n, n appears in row k.
If we form a graph on the positive integers by joining k to n if k appears in row n, then there is a connected component for each weight 1, 2, ...
The largest number in row n is 2n.
The smallest number in the component containing n is 2^A000120(n)-1, and n is reachable from 2^A000120(n)-1 in A023416(n) steps. - Rémy Sigrist, Jan 26 2019

			From 6 = 110 we can get 6 = 110, 11 = 3, 1010 = 10, or 1100 = 12, so row 6 is {3,6,10,12}.
From 7 = 111 we can get 7 = 111, 1011 = 11, 1101 = 13, or 1110 = 14, so row 7 is {7,11,13,14}.
The triangle begins:
   1,  2;
   1,  2,  4;
   3,  5,  6;
   2,  4,  8;
   3,  5,  9, 10;
   3,  6, 10, 12;
   7, 11, 13, 14;
   4,  8, 16;
   5,  9, 17, 18;
   5,  6, 10, 18, 20;
   7, 11, 19, 21, 22;
   6, 12, 20, 24;
   7, 13, 21, 25, 26;
   7, 14, 22, 26, 28;
  15, 23, 27, 29, 30;
   8, 16, 32;
  ...

Rémy Sigrist, Table of n, a(n) for n = 1..8208

Cf. A000120, A323286, A323455, A323456, A323466 (number of terms in each row), A323467 (minimal number in each row).

This is a base-2 analog of A323460.

r323465[n_] := Module[{digs=IntegerDigits[n, 2]} ,Map[FromDigits[#, 2]&, Union[Map[Insert[digs, 0, #+1]&, Flatten[Position[digs, 1]]], Map[Drop[digs, {#}]&, Flatten[Position[digs, 0]]], {digs}]]] (* nth row *)
a323465[{m_, n_}] := Flatten[Map[r323465, Range[m, n]]]
a323465[{1, 22}] (* Hartmut F. W. Hoft, Oct 24 2023 *)

More terms from Rémy Sigrist, Jan 27 2019

A323456 Irregular triangle read by rows: row n lists the numbers that can be obtained from the binary expansion of n by either deleting a single 0, or inserting a single 0 after any 1.

Original entry on oeis.org

2, 1, 4, 5, 6, 2, 8, 3, 9, 10, 3, 10, 12, 11, 13, 14, 4, 16, 5, 17, 18, 5, 6, 18, 20, 7, 19, 21, 22, 6, 20, 24, 7, 21, 25, 26, 7, 22, 26, 28, 23, 27, 29, 30, 8, 32, 9, 33, 34, 9, 10, 34, 36, 11, 35, 37, 38, 10, 12, 36, 40, 11, 13, 37, 41, 42, 11, 14, 38, 42, 44

Offset: 1

N. J. A. Sloane, Jan 17 2019

All the numbers in row n have the same binary weight (A000120) as n.
If k appears in row n, n appears in row k.
If we form a graph on the positive integers by joining k to n if k appears in row n, then there is a connected component for each weight 1, 2, , ...
The smallest number in the component containing n is 2^A000120(n)-1, and n is reachable from 2^A000120(n)-1 in A023416(n) steps. - Rémy Sigrist, Jan 17 2019

			From 6 = 110 we can get 11 = 3, 1010 = 10, or 1100 = 12, so row 6 is {3,10,12}.
From 7 = 111 we can get 1011 = 11, 1101 = 13, or 1110 = 14, so row 7 is {11,13,14}.
The triangle begins:
  2,
  1, 4,
  5, 6,
  2, 8,
  3, 9, 10,
  3, 10, 12,
  11, 13, 14,
  4, 16,
  5, 17, 18,
  5, 6, 18, 20,
  7, 19, 21, 22,
  ...

Rémy Sigrist, Rows n = 1..1000, flattened

Cf. A000120, A323455, A323465.

This is a base-2 analog of A323286.

r323456[n_] := Module[{digs=IntegerDigits[n, 2]} ,Map[FromDigits[#, 2]&, Union[Map[Insert[digs, 0, #+1]&, Flatten[Position[digs, 1]]], Map[Drop[digs, {#}]&, Flatten[Position[digs, 0]]]]]] (* nth row *)
a323456[{m_, n_}] := Flatten[Map[r323456, Range[m, n]]]
a323456[{1,22}] (* Hartmut F. W. Hoft, Oct 24 2023 *)

row(n) = { my (r=Set(), w=0, s=0); while (n, my (v=1+valuation(n,2)); r = setunion(r, Set(n*2^(w+1)+s)); if (v>1, r = setunion(r, Set(n*2^(w-1)+s))); s += (n%(2^v))*2^w; w += v; n \= 2^v); r } \\ Rémy Sigrist, Jan 27 2019

def row(n):
    b = bin(n)[2:]
    s1 = set(b[:i+1] + "0" + b[i+1:] for i in range(len(b)) if b[i] == "1")
    s2 = set(b[:i] + b[i+1:] for i in range(len(b)) if b[i] == "0")
    return sorted(int(w, 2) for w in s1 | s2)
print([c for n in range(1, 23) for c in row(n)]) # Michael S. Branicky, Jul 24 2022

More terms from Rémy Sigrist, Jan 27 2019

cp's OEIS Frontend

A323286 Choix de Bruxelles (version 1): irregular table read by rows in which row n lists all the legal numbers that can be reached by halving or doubling some substring of the decimal expansion of n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

PARI

Python

Extensions

A323465 Irregular triangle read by rows: row n lists the numbers that can be obtained from the binary expansion of n by either deleting a single 0, or inserting a single 0 after any 1, or doing nothing.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A323456 Irregular triangle read by rows: row n lists the numbers that can be obtained from the binary expansion of n by either deleting a single 0, or inserting a single 0 after any 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Python

Extensions