A328111 a(n) = A080069(n) OR A267357(n).

1, 3, 15, 47, 191, 743, 2935, 12015, 47615, 190363, 737255, 3092431, 11777535, 48562151, 194672615, 778681963, 3117668351, 12677730147, 49850341191, 192901085003, 795560607711, 3243899871031, 12977889600367, 51055599708139, 204124618746111, 791262494980483, 3318011560984519, 12661179187462123, 52138250822737375, 212591566440951715, 836346216751952367, 3236342451194541807

Offset: 0

Author

Antti Karttunen, Oct 05 2019

Keywords

• nonn

Comments

The pattern has a remarkably nice texture. A269174 gives the trajectory of 1-D Cellular Automaton rule 124 (which is a mirror image of rule 110), when started from a single alive cell. Trails of its evolution can be dimly discerned on the right hand side of given illustrations, while the left hand side shows the evolution of (left hand side of) iterated Dyck-path system A080069 unblemished.

Links

• Antti Karttunen, Table of n, a(n) for n = 0..1023
• Antti Karttunen, Terms up to a(255) drawn as binary strings, with 1 bit = 3x3 pixels resolution
• Antti Karttunen, Terms up to a(1023) drawn as binary strings, with 1 bit = 1 pixel resolution

Crossrefs

Cf. A003986, A267357, A269174.

Cf. A080069, A080070, and also A079438 and A123050.

Cf. also A328103.

Formula

a(n) = A080069(n) OR A267357(n), where OR is bitwise-OR, A003986.