This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A000455 Digits of powers of 2. (Formerly N0413) 1
 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, 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, 1, 0, 4, 8, 5, 7, 6, 2, 0, 9, 7, 1, 5, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 REFERENCES Archimedeans Problems Drive, Eureka, 11 (1949), 10. N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence). LINKS N. J. A. Sloane, Table of n, a(n) for n = 0..9999 MATHEMATICA 2^Range[0, 25] // IntegerDigits // Flatten (* Jean-François Alcover, Feb 08 2016 *) CROSSREFS Sequence in context: A210026 A100880 A102256 * A282821 A097888 A030275 Adjacent sequences:  A000452 A000453 A000454 * A000456 A000457 A000458 KEYWORD nonn,base,easy AUTHOR N. J. A. Sloane. Entry revised by N. J. A. Sloane, Jun 10 2012 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.