|
|
A043539
|
|
Number of distinct base-12 digits of n.
|
|
1
|
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,12
|
|
LINKS
|
|
|
FORMULA
|
a(11) = 1 since 11 in base 12 is written with a single digit.
a(13) = 1 since 13 in base 12 is written "11".
a(14) = 2 since 14 in base 12 is written "12".
a(146) is the first appearance of 3 in this sequence, since it is written "102" in base 12.
(End)
|
|
MATHEMATICA
|
Table[Length[Select[DigitCount[n, 12], #>0&]], {n, 100}] (* Vincenzo Librandi, Aug 13 2017 *)
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|