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 A255764 #16 Nov 03 2022 10:07:54
%S A255764 1,10,19,91,100,172,244,820,829,901,973,1549,1621,2197,2773,7381,7390,
%T A255764 7462,7534,8110,8182,8758,9334,13942,14014,14590,15166,19774,20350,
%U A255764 24958,29566,66430,66439,66511,66583,67159,67231,67807,68383,72991,73063,73639,74215
%N A255764 Partial sums of A255743.
%C A255764 Also, this is a row of the square array A255741.
%H A255764 Michael De Vlieger, <a href="/A255764/b255764.txt">Table of n, a(n) for n = 1..16384</a>
%H A255764 Hsien-Kuei Hwang, Svante Janson, and Tsung-Hsi Tsai, <a href="https://arxiv.org/abs/2210.10968">Identities and periodic oscillations of divide-and-conquer recurrences splitting at half</a>, arXiv:2210.10968 [cs.DS], 2022, p. 33.
%t A255764 Accumulate@ MapAt[Floor, Array[9*8^(DigitCount[# - 1, 2, 1] - 1) &, 43], 1] (* _Michael De Vlieger_, Nov 03 2022 *)
%o A255764 (PARI) lista(nn) = {s = 1; for (n=2, nn, print1(s, ", "); s += 9*8^(hammingweight(n-1)-1););} \\ _Michel Marcus_, Mar 15 2015
%Y A255764 Cf. A005408, A151788, A147562, A151790, A151781, A151792, A151793, A255740, A255741, A255743, A255764, A255765, A255766.
%K A255764 nonn
%O A255764 1,2
%A A255764 _Omar E. Pol_, Mar 05 2015
%E A255764 More terms from _Michel Marcus_, Mar 15 2015