A364779 -id:A364779 - cp's OEIS frontend

A364780 Number of numbers with sum of digits n in fractional base 4/3.

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, 174, 216, 268, 338, 417, 501, 627, 780, 974, 1203, 1454, 1825, 2266, 2769, 3427, 4268, 5188, 6433, 7930, 9671, 12000, 14738, 18265, 22642, 27961, 34528, 42523, 52325, 64425

Offset: 0

Kevin Ryde, Aug 13 2023

Only a finite number of numbers have sum of digits n (the largest is A364779(n)).

Kevin Ryde, Table of n, a(n) for n = 0..150
Kevin Ryde, C Code
Index entries for sequences related to fractional bases

Cf. A024631 (base 4/3), A244041 (sum of digits).
Cf. A357425 (smallest), A364779 (largest).
Cf. A245356 (count by length).

C
```
/* See links */
```

A364751 Minimum sum of digits for any number of length n digits in fractional base 4/3.

Original entry on oeis.org

0, 3, 5, 6, 6, 8, 8, 9, 10, 10, 11, 11, 11, 11, 13, 14, 16, 17, 17, 17, 18, 19, 21, 22, 22, 23, 24, 26, 26, 26, 27, 28, 29, 29, 29, 29, 29, 29, 31, 33, 34, 35, 36, 37, 38, 38, 38, 39, 39, 41, 41, 42, 42, 43, 43, 45, 45, 46, 46, 48, 50, 50, 52, 52, 52, 52, 53, 55

Offset: 1

Kevin Ryde, Sep 07 2023

0 is taken to be 1 digit long so a(1) = 0.

Terms can be derived from A364779 by a(n) = s for the smallest s where k = A364779(s) is >= n digits long (noting that stripping trailing 0's from k suffices to show numbers with sum of digits s exist at each length down to where sum s-1 exists).

Kevin Ryde, Table of n, a(n) for n = 1..209
Kevin Ryde, Mean Digit Plot
Index entries for sequences related to fractional bases

Cf. A024631 (base 4/3), A244041 (sum of digits), A364779 (largest with sum).

Cf. A363758 (maximum sum).

a(n) = Min_{4*A087192(n-1) <= k < 4*A087192(n)} A244041(k), for n >= 2.

cp's OEIS Frontend

A364780 Number of numbers with sum of digits n in fractional base 4/3.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

C