|
Search: id:A137214
|
|
|
| A137214 |
|
a(n)= number of distinct decimal digits in 2^n. |
|
+0
1
|
|
| 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 3, 5, 4, 4, 7, 6, 5, 4, 4, 4, 6, 6, 6, 9, 7, 7, 5, 6, 6, 7, 7, 8, 7, 7, 7, 6, 8, 7, 9, 8, 7, 8, 9, 7, 8, 9, 8, 7, 7, 8, 8, 7, 9, 8, 9, 9, 9, 9, 9, 9, 8, 9, 10, 9, 10, 7, 9, 8, 9, 9, 9, 8, 9, 10, 9, 9, 10, 9, 10, 9, 9, 10, 10, 10, 9, 8, 9, 9, 10, 10, 10, 10, 10
(list; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
FORMULA
|
a(n)=A043537(2^n). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Mar 16 2008
|
|
EXAMPLE
|
a(16) = 3 because 2^16=65536 which contains 3 distinct decimal digits [3,5,6].
|
|
MAPLE
|
A043537 := proc(n) nops(convert(convert(n, base, 10), set)) ; end: A137214 := proc(n) A043537(2^n) ; end: seq(A137214(n), n=0..120) ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Mar 16 2008
a:=proc(n) options operator, arrow: nops(convert(convert(2^n, base, 10), set)) end proc: seq(a(n), n=0..80); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 02 2008
|
|
CROSSREFS
|
Cf. A043562, A043536.
Adjacent sequences: A137211 A137212 A137213 this_sequence A137215 A137216 A137217
Sequence in context: A130535 A026819 A046155 this_sequence A081832 A034887 A082964
|
|
KEYWORD
|
easy,nonn,base
|
|
AUTHOR
|
Ctibor O. Zizka (ctibor.zizka(AT)seznam.cz), Mar 06 2008
|
|
EXTENSIONS
|
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl) and Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 16 2008
|
|
|
Search completed in 0.002 seconds
|
