A225901 Write n in factorial base, then replace each nonzero digit d of radix k with k-d.

0, 1, 4, 5, 2, 3, 18, 19, 22, 23, 20, 21, 12, 13, 16, 17, 14, 15, 6, 7, 10, 11, 8, 9, 96, 97, 100, 101, 98, 99, 114, 115, 118, 119, 116, 117, 108, 109, 112, 113, 110, 111, 102, 103, 106, 107, 104, 105, 72, 73, 76, 77, 74, 75, 90, 91, 94, 95, 92, 93, 84, 85, 88, 89, 86, 87, 78, 79, 82, 83, 80, 81, 48, 49, 52, 53, 50, 51, 66, 67, 70, 71, 68

Offset

0,3

Comments

Analogous to A004488 or A048647 for the factorial base.

A self-inverse permutation of the natural numbers.

From Antti Karttunen, Aug 16-29 2016: (Start)

Consider the following way to view a factorial base representation of nonnegative integer n. For each nonzero digit d_i present in the factorial base representation of n (where i is the radix = 2.. = one more than 1-based position from the right), we place a pebble to the level (height) d_i at the corresponding column i of the triangular diagram like below, while for any zeros the corresponding columns are left empty:

.

Level

6 o

─ ─

5 . .

─ ─ ─

4 . . .

─ ─ ─ ─

3 . . . .

─ ─ ─ ─ ─

2 . . o . .

─ ─ ─ ─ ─ ─

1 . o . . o o

─ ─ ─ ─ ─ ─ ─

Radix: 7 6 5 4 3 2

Digits: 6 1 2 0 1 1 = A007623(4491)

Instead of levels, we can observe on which "slope" each pebble (nonzero digit) is located at. Formally, the slope of nonzero digit d_i with radix i is (i - d_i). Thus in above example, both the most significant digit (6) and the least significant 1 are on slope 1 (called "maximal slope", because it contains digits that are maximal allowed in those positions), while the second 1 from the right is on slope 2 ("submaximal slope").

This involution (A225901) sends each nonzero digit at level k to the slope k (and vice versa) by flipping such a diagram by the shallow diagonal axis that originates from the bottom right corner. Thus, from above diagram we obtain:

Slope (= digit's radix - digit's value)

1

2 .

3 . .╲

4 . .╲o╲

5 . .╲.╲.╲

6 . .╲.╲o╲.╲

. .╲.╲.╲.╲o╲

o╲.╲.╲.╲.╲o╲

-----------------

1 5 3 0 2 1 = A007623(1397)

and indeed, a(4491) = 1397 and a(1397) = 4491.

Thus this permutation maps between polynomial encodings A275734 & A275735 and all the respective sequences obtained from them, where the former set of sequences are concerned with the "slopes" and the latter set with the "levels" of the factorial base representation. See the Crossrefs section.

Sequences A231716 and A275956 are closed with respect to this sequence, in other words, for all n, a(A231716(n)) is a term of A231716 and a(A275956(n)) is a term of A275956.

(End)

Links

Paul Tek, Table of n, a(n) for n = 0..5039

Index entries for sequences related to factorial base representation

Index entries for sequences that are permutations of the natural numbers

Formula

From Antti Karttunen, Aug 29 2016: (Start)

a(0) = 0; for n >= 1, a(n) = A276091(A275736(n)) + A153880(a(A257684(n))).

or, for n >= 1, a(n) = A276149(n) + a(A257687(n)).

(End)

Other identities. For n >= 0:

a(n!) = A001563(n).

a(n!-1) = A007489(n-1).

From Antti Karttunen, Aug 16 2016: (Start)

A275734(a(n)) = A275735(n) and vice versa, A275735(a(n)) = A275734(n).

A060130(a(n)) = A060130(n). [The flip preserves the number of nonzero digits.]

A153880(n) = a(A255411(a(n))) and A255411(n) = a(A153880(a(n))). [This involution conjugates between the two fundamental factorial base shifts.]

a(n) = A257684(a(A153880(n))) = A266193(a(A255411(n))). [Follows from above.]

A276011(n) = A273662(a(A273670(n))).

A276012(n) = A273663(a(A256450(n))).

(End)

Example

a(1000) = a(1*6! + 2*5! + 1*4! + 2*3! + 2*2!) = (7-1)*6! + (6-2)*5! + (5-1)*4! + (4-2)*3! + (3-2)*2! = 4910.
a(1397) = a(1*6! + 5*5! + 3*4! + 0*3! + 2*2! + 1*1!) = (7-1)*6! + (6-5)*5! + (5-3)*4! + (3-2)*2! + (2-1)*1! = 4491.

Mathematica

b = MixedRadix[Reverse@ Range[2, 12]]; Table[FromDigits[Map[Boole[# > 0] &, #] (Reverse@ Range[2, Length@ # + 1] - #), b] &@ IntegerDigits[n, b], {n, 0, 82}] (* Version 10.2, or *)
f[n_] := Block[{a = {{0, n}}}, Do[AppendTo[a, {First@ #, Last@ #} &@ QuotientRemainder[a[[-1, -1]], Times @@ Range[# - i]]], {i, 0, #}] &@ NestWhile[# + 1 &, 0, Times @@ Range[# + 1] <= n &]; Most@ Rest[a][[All, 1]] /. {} -> {0}]; g[w_List] := Total[Times @@@ Transpose@ {Map[Times @@ # &, Range@ Range[0, Length@ w]], Reverse@ Append[w, 0]}]; Table[g[Map[Boole[# > 0] &, #] (Reverse@ Range[2, Length@ # + 1] - #)] &@ f@ n, {n, 0, 82}] (* Michael De Vlieger, Aug 29 2016 *)

Prog

(PARI) a(n)=my(s=0, d, k=2); while(n, d=n%k; n=n\k; if(d, s=s+(k-d)*(k-1)!); k=k+1); return(s)
(Scheme)
(define (A225901 n) (let loop ((n n) (z 0) (m 2) (f 1)) (cond ((zero? n) z) (else (loop (quotient n m) (if (zero? (modulo n m)) z (+ z (* f (- m (modulo n m))))) (+ 1 m) (* f m))))))
;; One implementing the first recurrence, with memoization-macro definec:
(definec (A225901 n) (if (zero? n) n (+ (A276091 (A275736 n)) (A153880 (A225901 (A257684 n))))))
;; Antti Karttunen, Aug 29 2016
(Python)
from sympy import factorial as f
def a(n):
    s=0
    k=2
    while(n):
        d=n%k
        n=(n//k)
        if d: s=s+(k - d)*f(k - 1)
        k+=1
    return s
print([a(n) for n in range(101)]) # Indranil Ghosh, Jun 19 2017

Crossrefs

Cf. A000142, A007623, A004488, A048647, A001563, A007489, A257684, A257687, A276091, A275736, A276149.

Cf. A275959 (fixed points), A231716, A275956.

Cf. A153880 & A255411.

Cf. also A275734 & A275735, A275952 & A275954.

This involution maps between the following sequences related to "levels" and "slopes" (see comments): A275806 <--> A060502, A257511 <--> A260736, A264990 <--> A275811, A275729 <--> A275728, A275948 <--> A275946, A275949 <--> A275947, A275964 <--> A275962, A059590 <--> A276091.

Related permutations: A275957, A275958, A275835, A275836, A275837, A275838, A276011, A276012.

Sequence in context: A328622 A338248 A328623 * A354469 A030322 A105662

Adjacent sequences: A225898 A225899 A225900 * A225902 A225903 A225904

Keyword

nonn,base

Author

Paul Tek, May 20 2013

Status

approved