login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A275806 a(n) = number of distinct nonzero digits in factorial base representation of n. 11

%I #27 Feb 07 2024 01:17:46

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

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

%U 3,3,2,3,1,2,2,2,2,3,2,2,2,2,3,3,2,3,3,3,2,3,1,2,2,2,2,3,1,2,2,2,2,3,2,2,2,2,3,3,2,3,3,3,2,3,2,3,3,3,3,4,1

%N a(n) = number of distinct nonzero digits in factorial base representation of n.

%H Antti Karttunen, <a href="/A275806/b275806.txt">Table of n, a(n) for n = 0..40320</a>

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

%F a(n) = A001221(A275735(n)).

%F a(n) = A060502(A225901(n)).

%F Other identities. For all n >= 0:

%F a(n) = a(A153880(n)) = a(A255411(n)). [The shift-operations do not change the number of distinct nonzero digits.]

%F a(A265349(n)) = A060130(A265349(n)).

%F a(A000142(n)) = 1.

%F a(A033312(n)) = n-1, for all n >= 1.

%e For n=0, with factorial base representation (A007623) also 0, there are no nonzero digits, thus a(0) = 0.

%e For n=2, with factorial base representation "10", there is one distinct nonzero digit, thus a(2) = 1.

%e For n=3, with factorial base representation "11", there is just one distinct nonzero digit, thus a(3) = 1.

%e For n=44, with factorial base representation "1310", there are two distinct nonzero digits ("1" and "3"), thus a(44) = 2.

%t a[n_] := Module[{k = n, m = 2, r, s = {}}, While[{k, r} = QuotientRemainder[k, m]; k != 0|| r != 0, AppendTo[s, r]; m++]; Length[Union[Select[s, # > 0 &]]]]; Array[a, 100, 0] (* _Amiram Eldar_, Feb 07 2024 *)

%o (Scheme) (define (A275806 n) (A001221 (A275735 n)))

%o (Python)

%o from sympy import prime, primefactors

%o from operator import mul

%o import collections

%o def a007623(n, p=2): return n if n<p else a007623(n//p, p+1)*10 + n%p

%o def a275735(n):

%o y=collections.Counter(map(int, list(str(a007623(n)).replace("0", "")))).most_common()

%o return 1 if n==0 else reduce(mul, [prime(y[i][0])**y[i][1] for i in range(len(y))])

%o def a(n): return len(primefactors(a275735(n)))

%o print([a(n) for n in range(201)]) # _Indranil Ghosh_, Jun 20 2017

%Y Cf. A000142, A001221, A007623, A033312, A060130, A060502, A225901, A265349, A275735.

%Y Cf. also A153880, A255411.

%K nonn,base

%O 0,6

%A _Antti Karttunen_, Aug 11 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 04:14 EDT 2024. Contains 371918 sequences. (Running on oeis4.)