# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a255765
Showing 1-1 of 1

%I A255765 #21 Nov 03 2022 08:43:09
%S A255765 1,11,21,111,121,211,301,1111,1121,1211,1301,2111,2201,3011,3821,
%T A255765 11111,11121,11211,11301,12111,12201,13011,13821,21111,21201,22011,
%U A255765 22821,30111,30921,38211,45501,111111,111121,111211,111301,112111,112201,113011,113821,121111
%N A255765 Partial sums of A255744.
%C A255765 Also, this is a row of the square array A255741.
%C A255765 Is this sequence related to positive repunits? (see formula section).
%H A255765 Felix Fröhlich, <a href="/A255765/b255765.txt">Table of n, a(n) for n = 1..10000</a>
%H A255765 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.
%F A255765 Question: a(2^k) = A002275(k+1), k >= 0. Is this true?
%t A255765 Accumulate@ MapAt[Floor, Array[10*9^(DigitCount[# - 1, 2, 1] - 1) &, 40], 1] (* _Michael De Vlieger_, Nov 03 2022 *)
%o A255765 (PARI) lista(nn) = {s = 1; for (n=2, nn, print1(s, ", "); s += 10*9^(hammingweight(n-1)-1););} \\ _Michel Marcus_, Mar 15 2015
%o A255765 (PARI) a(n) = sum(k=1, n, if (k==1, 1, 10*9^(hammingweight(k-1)-1))); \\ _Michel Marcus_, Mar 15 2015
%Y A255765 Cf. A002275, A005408, A151788, A147562, A151790, A151781, A151792, A151793, A255740, A255741, A255744, A255764, A255766.
%K A255765 nonn
%O A255765 1,2
%A A255765 _Omar E. Pol_, Mar 05 2015
%E A255765 More terms from _Michel Marcus_, Mar 15 2015

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE