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.
%I A328111 #19 May 03 2021 18:37:32 %S A328111 1,3,15,47,191,743,2935,12015,47615,190363,737255,3092431,11777535, %T A328111 48562151,194672615,778681963,3117668351,12677730147,49850341191, %U A328111 192901085003,795560607711,3243899871031,12977889600367,51055599708139,204124618746111,791262494980483,3318011560984519,12661179187462123,52138250822737375,212591566440951715,836346216751952367,3236342451194541807 %N A328111 a(n) = A080069(n) OR A267357(n). %C A328111 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. %H A328111 Antti Karttunen, <a href="/A328111/b328111.txt">Table of n, a(n) for n = 0..1023</a> %H A328111 Antti Karttunen, <a href="/A328111/a328111.png">Terms up to a(255) drawn as binary strings, with 1 bit = 3x3 pixels resolution</a> %H A328111 Antti Karttunen, <a href="/A328111/a328111_1.png">Terms up to a(1023) drawn as binary strings, with 1 bit = 1 pixel resolution</a> %F A328111 a(n) = A080069(n) OR A267357(n), where OR is bitwise-OR, A003986. %Y A328111 Cf. A003986, A267357, A269174. %Y A328111 Cf. A080069, A080070, and also A079438 and A123050. %Y A328111 Cf. also A328103. %K A328111 nonn %O A328111 0,2 %A A328111 _Antti Karttunen_, Oct 05 2019