login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A323455
Irregular triangle read by rows: row n lists the numbers that can be obtained from the binary expansion of n by inserting a single 0 after any 1.
4
2, 4, 5, 6, 8, 9, 10, 10, 12, 11, 13, 14, 16, 17, 18, 18, 20, 19, 21, 22, 20, 24, 21, 25, 26, 22, 26, 28, 23, 27, 29, 30, 32, 33, 34, 34, 36, 35, 37, 38, 36, 40, 37, 41, 42, 38, 42, 44, 39, 43, 45, 46, 40, 48, 41, 49, 50, 42, 50, 52, 43, 51, 53, 54, 44, 52, 56
OFFSET
1,1
COMMENTS
All the numbers in row n have the same binary weight (A000120) as n.
LINKS
Michael S. Branicky, Table of n, a(n) for n = 1..10870 (Rows 1..2000, flattened)
EXAMPLE
From 7 = 111 we can get 1011 = 11, 1101 = 13, and 1110 = 14, so row 7 is {11,13,14}.
The triangle begins:
2,
4,
5, 6,
8,
9, 10,
10, 12,
11, 13, 14,
16,
17, 18,
18, 20,
19, 21, 22,
...
MATHEMATICA
r323455[n_] := Module[{digs=IntegerDigits[n, 2]}, Map[FromDigits[#, 2]&, Map[Insert[digs, 0, #+1]&, Flatten[Position[digs, 1]]]]] (* nth row *)
a323455[{m_, n_}] := Flatten[Map[r323455, Range[m, n]]]
a323455[{1, 28}] (* Hartmut F. W. Hoft, Oct 24 2023 *)
PROG
(Python)
def row(n):
b = bin(n)[2:]
s = set(b[:i+1] + "0" + b[i+1:] for i in range(len(b)) if b[i] == "1")
return sorted(int(w, 2) for w in s)
print([c for n in range(1, 29) for c in row(n)]) # Michael S. Branicky, Jul 24 2022
CROSSREFS
Cf. A000120. See A323456 for a closely related sequence, the binary analog of A323386.
Sequence in context: A230581 A361825 A248962 * A133398 A138836 A175431
KEYWORD
nonn,base,tabf
AUTHOR
N. J. A. Sloane, Jan 16 2019
EXTENSIONS
More terms from David Consiglio, Jr., Jan 17, 2019
a(49) and beyond from Michael S. Branicky, Jul 24 2022
STATUS
approved