login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080751 a(n) is smallest number greater than a(n-1) such that the sequence contains a total of a(n) base 10 digits + commas through n terms (assuming one comma between each pair of terms). 0
1, 3, 5, 7, 9, 12, 15, 18, 21, 24, 27, 30, 33, 36, 39, 42, 45, 48, 51, 54, 57, 60, 63, 66, 69, 72, 75, 78, 81, 84, 87, 90, 93, 96, 99, 103, 107, 111, 115, 119, 123, 127, 131, 135, 139, 143, 147, 151, 155, 159, 163, 167, 171, 175, 179, 183, 187, 191, 195, 199, 203, 207 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

The comma after a term is not counted as part of that term.

LINKS

Table of n, a(n) for n=1..62.

EXAMPLE

a(1)=1, the only possible initial term in base 10. a(5)=9, the smallest possible number (the other candidate is 10) such that the sequence after 5 terms would contain a(n) base 10 digits + commas.

CROSSREFS

Cf. A080676.

Sequence in context: A072154 A309269 A204206 * A025218 A258782 A007078

Adjacent sequences:  A080748 A080749 A080750 * A080752 A080753 A080754

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 17 08:36 EDT 2019. Contains 328107 sequences. (Running on oeis4.)