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”).
%I #20 Dec 17 2023 03:12:48
%S 1,1,1,2,1,2,4,3,5,6,7,14,13,15,19,19,30,39,45,56,65,75,95,124,140,
%T 174,216,268,338,417,501,627,780,974,1203,1454,1825,2266,2769,3427,
%U 4268,5188,6433,7930,9671,12000,14738,18265,22642,27961,34528,42523,52325,64425
%N Number of numbers with sum of digits n in fractional base 4/3.
%C Only a finite number of numbers have sum of digits n (the largest is A364779(n)).
%H Kevin Ryde, <a href="/A364780/b364780.txt">Table of n, a(n) for n = 0..150</a>
%H Kevin Ryde, <a href="/A364779/a364779_2.c.txt">C Code</a>
%H <a href="/index/Ba#base_fractional">Index entries for sequences related to fractional bases</a>
%o (C) See links.
%Y Cf. A024631 (base 4/3), A244041 (sum of digits).
%Y Cf. A357425 (smallest), A364779 (largest).
%Y Cf. A245356 (count by length).
%K nonn,base
%O 0,4
%A _Kevin Ryde_, Aug 13 2023