A354852 a(n) is the number of distinct ways to represent n using any mixed radix numeral system.

1, 2, 3, 5, 6, 8, 9, 13, 15, 18, 19, 20, 21, 27, 30, 35, 36, 40, 41, 47, 50, 58, 59, 51, 54, 69, 77, 84, 85, 79, 80, 94, 102, 116, 118, 101, 102, 122, 132, 129, 130, 135, 136, 161, 165, 182, 183, 140, 144, 169, 186, 219, 220, 210, 213, 230, 240, 269, 270, 198, 199, 248, 262, 265, 276, 282, 283

Offset

1,2

Links

Max J. Folkers, Table of n, a(n) for n = 1..999

Joerg Arndt, Matters Computational (The Fxtbook), chapter 9, "Mixed radix numbers", p. 217.

Formula

Conjecture: a(p) = a(p-1)+1 whenever p is a prime number.

Example

For n=5, the a(5) = 6 different digit strings which can give 5 are
  digits    mixed radix
    101       2,2,2
     10         2,5
     11         2,4
     12         2,3
     21         3,2
      5           6

Crossrefs

Sequence in context: A058588 A357742 A035399 * A153775 A173666 A063756

Adjacent sequences: A354849 A354850 A354851 * A354853 A354854 A354855

Keyword

nonn,base

Author

Max J. Folkers, Jun 08 2022

Status

approved