A368160 For any n > 0, a(n) is obtained by interpreting the factorial base expansion of n in base m + 1, where m is the maximum digit in the factorial base expansion of n; a(0) = 0.

0, 1, 2, 3, 6, 7, 4, 5, 6, 7, 15, 16, 18, 19, 21, 22, 24, 25, 48, 49, 52, 53, 56, 57, 8, 9, 10, 11, 33, 34, 12, 13, 14, 15, 42, 43, 45, 46, 48, 49, 51, 52, 112, 113, 116, 117, 120, 121, 54, 55, 57, 58, 60, 61, 63, 64, 66, 67, 69, 70, 72, 73, 75, 76, 78, 79

Offset

0,3

Comments

Every nonnegative integer appears finitely many times in this sequence.

Links

Rémy Sigrist, Table of n, a(n) for n = 0..10000

Index entries for sequences related to factorial base representation

Formula

a(A059590(n)) = n.

a(k!) = 2^(k-1) for any k > 0.

Example

For n = 42: the factorial base expansion of 42 is "1300" and has maximum digit 3, so the base-4 expansion of a(42) is "1300", and a(42) = 112.

Prog

(PARI) a(n) = { my (d = []); for (r = 2, oo, if (n==0, return (if (#d, fromdigits(d, vecmax(d)+1), 0)), d = concat(n%r, d); n \=r; ); ); }

Crossrefs

Cf. A059590, A068505, A246359.

Sequence in context: A114462 A308511 A169746 * A234613 A258996 A092569

Adjacent sequences: A368157 A368158 A368159 * A368161 A368162 A368163

Keyword

nonn,base,easy

Author

Rémy Sigrist, Dec 14 2023

Status

approved