|
%I N0413 #33 May 10 2020 19:12:45
%S 1,2,4,8,1,6,3,2,6,4,1,2,8,2,5,6,5,1,2,1,0,2,4,2,0,4,8,4,0,9,6,8,1,9,
%T 2,1,6,3,8,4,3,2,7,6,8,6,5,5,3,6,1,3,1,0,7,2,2,6,2,1,4,4,5,2,4,2,8,8,
%U 1,0,4,8,5,7,6,2,0,9,7,1,5,2
%N Digits of powers of 2.
%C The number 0.a(0)a(1)a(2)...=0.124816... is a rich (or disjunctive) number. - _Robert FERREOL_, Apr 01 2020
%D Archimedeans Problems Drive, Eureka, 11 (1949), 10.
%D David Gale, Tracking the Automatic ANT And Other Mathematical Explorations, 1998, pp. 42-43.
%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%H N. J. A. Sloane, <a href="/A000455/b000455.txt">Table of n, a(n) for n = 0..9999</a>
%t 2^Range[0, 25] // IntegerDigits // Flatten (* _Jean-François Alcover_, Feb 08 2016 *)
%o (Scala) (List.fill(32)(2: BigInt)).scanLeft(1: BigInt)(_ * _).map(_.toString.toCharArray).flatten.map(_.toInt - 48) // _Alonso del Arte_, Mar 28 2020
%Y Cf. A000079.
%K nonn,base,easy
%O 0,2
%A _N. J. A. Sloane_; entry revised by _N. J. A. Sloane_, Jun 10 2012
|
