[seqfan] Re: A puzzle from Emissary
andrew.weimholt at gmail.com
Wed Nov 30 23:19:45 CET 2011
On 11/30/11, Charles Greathouse <charles.greathouse at case.edu> wrote:
> Two (presumably) hard sequences, for any given generalization to
> arbitrary bases, would be "the constant C in base n" and "the constant
> C in base n, ignoring finitely many integers".
Another set of related sequences that can be done for each base...
1) Number of ways that n can reach a single base-b digit in its minimal
number of steps. (I say "its minimal number", because some numbers
will require less than C steps).
2) Smallest number that can reach a single base-b digit in its minimal
number of steps in exactly n ways.
More information about the SeqFan