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!)
A107846 Number of duplicate digits of n. 3
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,112
COMMENTS
a(A010784(n)) = 0; a(A109303(n)) > 0. - Reinhard Zumkeller, Jul 09 2013
LINKS
FORMULA
a(n) = A055642(n) - A043537(n).
EXAMPLE
a(11) = 1 because 11 has two total decimal digits but only one distinct digit (1) and 2-1=1.
Similarly, a(3653135) = 7 (total digits) - 4 (distinct digits: 1,3,5,6) = 3 (There are three duplicate digits here, namely, 3, 3 and 5).
MATHEMATICA
Table[Total[Select[DigitCount[n]-1, #>0&]], {n, 0, 120}] (* Harvey P. Dale, Jul 31 2013 *)
PROG
(Haskell)
import Data.List (sort, group)
a107846 = length . concatMap tail . group . sort . show :: Integer -> Int
-- Reinhard Zumkeller, Jul 09 2013
(Python)
def a(n): return len(s:=str(n)) - len(set(s))
print([a(n) for n in range(105)]) # Michael S. Branicky, Jan 09 2023
CROSSREFS
Cf. A055642 (Total decimal digits of n), A043537 (Distinct decimal digits of n).
Sequence in context: A355444 A070109 A355454 * A354983 A179801 A353474
KEYWORD
base,easy,nonn
AUTHOR
Rick L. Shepherd, May 24, 2005
STATUS
approved

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 19 12:14 EDT 2024. Contains 371792 sequences. (Running on oeis4.)