login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A275964 Total number of nonzero digits with multiple occurrences in factorial base representation of n (counted with multiplicity): a(n) = A275812(A275735(n)). 8
0, 0, 0, 2, 0, 0, 0, 2, 2, 3, 0, 2, 0, 0, 0, 2, 2, 2, 0, 0, 0, 2, 0, 0, 0, 2, 2, 3, 0, 2, 2, 3, 3, 4, 2, 3, 0, 2, 2, 3, 2, 4, 0, 2, 2, 3, 0, 2, 0, 0, 0, 2, 2, 2, 0, 2, 2, 3, 2, 4, 2, 2, 2, 4, 3, 3, 0, 0, 0, 2, 2, 2, 0, 0, 0, 2, 0, 0, 0, 2, 2, 3, 0, 2, 0, 0, 0, 2, 2, 2, 2, 2, 2, 4, 2, 2, 0, 0, 0, 2, 0, 0, 0, 2, 2, 3, 0, 2, 0, 0, 0, 2, 2, 2, 0, 0, 0, 2, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

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

Indranil Ghosh, Python program for computing this sequence

Index entries for sequences related to factorial base representation

FORMULA

a(n) = A275812(A275735(n)).

Other identities and observations. For all n >= 0.

a(n) = A275962(A225901(n)).

a(n) = A060130(n) - A275948(n).

a(n) >= A275949(n).

EXAMPLE

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

For n=2, with factorial base representation "10", there are no nonzero digits that are present multiple times, thus a(2) = 0.

For n=3 ("11") there is one nonzero digit which occurs more than once, and it occurs two times in total, thus a(3) = 2.

For n=41 ("1221") there are two distinct nonzero digits ("1" and "2"), and both occur more than once, namely twice each, thus a(41) = 2+2 = 4.

For n=44 ("1310") there are two distinct nonzero digits ("1" and "3"), but only the other (1) occurs more than once (two times), thus a(44) = 2.

For n=279 ("21211") there are two distinct nonzero digits present that occur more than once, digit 2 twice, and digit 1 for three times, thus a(279) = 2+3 = 5.

PROG

(Scheme) (define (A275964 n) (A275812 (A275735 n)))

CROSSREFS

Cf. A275735, A275812.

Cf. A265349 (indices of zeros), A265350 (of terms > 0).

Cf. also A060130, A225901, A275948, A275949.

Sequence in context: A291957 A143063 A210703 * A284272 A175070 A054923

Adjacent sequences:  A275961 A275962 A275963 * A275965 A275966 A275967

KEYWORD

nonn,base

AUTHOR

Antti Karttunen, Aug 15 2016

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 11 19:37 EST 2018. Contains 318049 sequences. (Running on oeis4.)