A391096 a(n) is largest number 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).

1, 3, 5, 7, 10, 13, 16, 19, 22, 25, 28, 31, 34, 37, 40, 43, 46, 49, 52, 55, 58, 61, 64, 67, 70, 73, 76, 79, 82, 85, 88, 91, 94, 97, 101, 105, 109, 113, 117, 121, 125, 129, 133, 137, 141, 145, 149, 153, 157, 161, 165, 169, 173, 177, 181, 185, 189, 193, 197, 201, 205, 209

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)=10, the largest possible number (the other candidate is 9) such that the sequence after 5 terms would contain a(n) base 10 digits + commas.

Crossrefs

Cf. A080751.

Sequence in context: A211273 A198409 A330072 * A213510 A130257 A276498

Adjacent sequences: A391093 A391094 A391095 * A391097 A391098 A391099

Keyword

base,easy,nonn

Author

Jim Hays, Nov 28 2025

Status

approved