|
|
A119798
|
|
Numbers m such that m and 2*m have the same number of distinct digits in decimal representation.
|
|
4
|
|
|
0, 1, 2, 3, 4, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 56, 57, 58, 59, 61, 72, 83, 94, 100, 101, 102, 103, 104, 105, 107, 108, 109, 110, 111, 112, 113
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
|
|
LINKS
|
|
|
MATHEMATICA
|
snddQ[n_]:=Count[DigitCount[n], _?(#>0&)]==Count[DigitCount[2n], _?(#>0&)]; Select[Range[0, 120], snddQ] (* Harvey P. Dale, Oct 07 2012 *)
|
|
PROG
|
(Haskell)
a119798 n = a119798_list !! (n-1)
a119798_list = f [0..] a043537_list a043537_list where
f (z:zs) (u:us) (v:_:vs) | u /= v = f zs us vs
| otherwise = z : f zs us vs
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|