id:A080751 - OEIS Search Results

Search: id:A080751

Displaying 1-1 of 1 results found.

page 1

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

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; listen)

	OFFSET	`1,2`
	COMMENT	`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: A047932 A139130 A072154 this_sequence A025218 A007078 A118015` `Adjacent sequences: A080748 A080749 A080750 this_sequence A080752 A080753 A080754`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Matthew Vandermast (ghodges14(AT)comcast.net), Mar 08 2003`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research