The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A080750 a(n) = largest number greater than a(n-1) such that the first n terms of the sequence contain a total of a(n) base-10 digits. 0
 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 101, 104, 107, 110, 113, 116, 119, 122, 125, 128, 131, 134, 137, 140 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Table of n, a(n) for n=1..67. EXAMPLE a(1) = 1, the only possible first term in base 10. a(9) = 10, the largest possible 9th term (the other possibility is 9) such that the first 9 terms of the sequence contain a total of a(n) base-10 digits. CROSSREFS Cf. A080676. Sequence in context: A316114 A316115 A032958 * A113768 A122936 A330729 Adjacent sequences: A080747 A080748 A080749 * A080751 A080752 A080753 KEYWORD base,easy,nonn AUTHOR Matthew Vandermast, Mar 08 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 15 19:27 EDT 2024. Contains 374334 sequences. (Running on oeis4.)