A276950 Characteristic function for A273670: 1 if there is at least one maximal digit present in the factorial representation of n (A007623), otherwise 0.

0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0

Offset

0

Links

Antti Karttunen, Table of n, a(n) for n = 0..5040

Index entries for characteristic functions.

Index entries for sequences related to factorial base representation.

Formula

If A260736(n) = 0 then a(n) = 0, otherwise a(n) = 1.

a(n) = A257680(A225901(n)).

Other identities. For all n >= 0:

a(A153880(n)) = 0 and a(A273670(n)) = 1.

a(A005408(n)) = 1.

Mathematica

a[n_] := Module[{k = n, m = 2, c = 0, r}, While[{k, r} = QuotientRemainder[k, m]; k != 0 || r != 0, If[r == m - 1, c++]; m++]; If[c > 0, 1, 0]]; Array[a, 100, 0] (* Amiram Eldar, Feb 07 2024 *)

Prog

(Scheme, two alternative implementations)
(define (A276950 n) (if (zero? (A260736 n)) 0 1))
(define (A276950 n) (A257680 (A225901 n)))

Crossrefs

Cf. A276952 (partial sums).

Cf. A005408, A007623, A153880, A225901, A257680, A260736, A273670, A276948.

Sequence in context: A280237 A259044 A285383 * A285351 A284893 A316829

Adjacent sequences: A276947 A276948 A276949 * A276951 A276952 A276953

Keyword

nonn,base

Author

Antti Karttunen, Sep 22 2016

Status

approved