A257260 - OEIS

%I #18 Feb 07 2024 01:17:18

%S 0,1,0,1,0,1,2,1,0,1,0,1,2,1,0,1,0,1,2,1,0,1,0,1,2,1,3,1,3,1,2,1,0,1,

%T 0,1,2,1,0,1,0,1,2,1,0,1,0,1,2,1,3,1,3,1,2,1,0,1,0,1,2,1,0,1,0,1,2,1,

%U 0,1,0,1,2,1,3,1,3,1,2,1,0,1,0,1,2,1,0,1,0,1,2,1,0,1,0,1,2,1,3,1,3,1,2,1,0,1,0,1,2,1,0,1,0,1,2,1,0,1,0,1

%N One-based position of the rightmost zero in the factorial base representation of n (A007623), 0 if no nonleading zeros present.

%C a(n) gives the distance of the rightmost zero from the right hand end of factorial base representation of n (A007623), particularly, 1 when n is even, and 0 for those cases when there are no nonleading zeros present (terms of A227157).

%C Sequence starts from n=1, to avoid ambiguities with case zero.

%H Antti Karttunen, <a href="/A257260/b257260.txt">Table of n, a(n) for n = 1..10080</a>

%H <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a>.

%e For n = 1, with factorial base representation (A007623) "1", there are no nonleading zeros at all, thus a(1) = 0.

%e For n = 6, with representation "100", the rightmost zero occurs at digit-position 1 (when the least significant digit has index 1, etc.), thus a(6) = 1.

%e For n = 7, with representation "101", the rightmost zero occurs at position 2, thus a(7) = 2.

%t a[n_] := Module[{k = n, m = 2, r, s = {}, p}, While[{k, r} = QuotientRemainder[k, m]; k != 0|| r != 0, AppendTo[s, r]; m++]; If[MissingQ[(p = FirstPosition[s, 0])], 0, p[[1]]]]; Array[a, 100] (* _Amiram Eldar_, Feb 07 2024 *)

%o (Scheme) (define (A257260 n) (let loop ((n n) (i 2)) (cond ((zero? n) 0) ((zero? (modulo n i)) (- i 1)) (else (loop (floor->exact (/ n i)) (+ 1 i))))))

%Y Cf. A007623, A227157 (positions of zeros), A000012 (even bisection).

%Y Cf. also A257261, A230403, and arrays of permutations A060117 and A060118.

%K nonn,base

%O 1,7

%A _Antti Karttunen_, Apr 29 2015