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