login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
1,2
COMMENTS
The comma after a term is not counted as part of that term.
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: A309269 A362135 A204206 * A025218 A258782 A349993
KEYWORD
base,easy,nonn
AUTHOR
Matthew Vandermast, Mar 08 2003
STATUS
approved