This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A137214 a(n)= number of distinct decimal digits in 2^n. 2
 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; refs; listen; history; text; internal format)
 OFFSET 0,5 COMMENTS Appears to be all 10s starting at a(169). - T. D. Noe, Apr 01 2014 LINKS T. D. Noe, Table of n, a(n) for n = 0..1000 FORMULA a(n) = A043537(2^n). - R. J. Mathar, 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, 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, Apr 02 2008 MATHEMATICA Table[Length[Union[IntegerDigits[2^n]]], {n, 0, 100}] (* T. D. Noe, Apr 01 2014 *) CROSSREFS Cf. A043562, A043536. Sequence in context: A046155 A026819 A302342 * A284726 A319951 A222642 Adjacent sequences:  A137211 A137212 A137213 * A137215 A137216 A137217 KEYWORD easy,nonn,base AUTHOR Ctibor O. Zizka, Mar 06 2008 EXTENSIONS More terms from R. J. Mathar and Emeric Deutsch, Mar 16 2008 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.

Last modified June 26 20:30 EDT 2019. Contains 324380 sequences. (Running on oeis4.)