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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A235698 a(n+1) = a(n) + (smallest digit of a(n)) + 1, a(0)=0. 1
0, 1, 3, 7, 15, 17, 19, 21, 23, 26, 29, 32, 35, 39, 43, 47, 52, 55, 61, 63, 67, 74, 79, 87, 95, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 113, 115, 117, 119, 121, 123, 125, 127, 129, 131, 133, 135, 137, 139, 141, 143, 145, 147, 149, 151, 153, 155, 157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181, 183, 185, 187 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

It is obvious why the "+ 1" has to be there.

In the range where 100 < a(n) < 200, the gaps may only be 1 or 2, similarly for other multiples of 100, 1000, etc

LINKS

Table of n, a(n) for n=0..73.

PROG

(PARI) print1(0", "a=1); for(i=1, 99, print1(", ", a+=vecmin(digits(a))+1))

CROSSREFS

Cf. A045844.

Sequence in context: A295930 A143703 A098582 * A089432 A111294 A092899

Adjacent sequences:  A235695 A235696 A235697 * A235699 A235700 A235701

KEYWORD

nonn,easy,base

AUTHOR

M. F. Hasler, Jan 14 2014

EXTENSIONS

PARI code corrected by Colin Barker, Sep 20 2014

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 December 10 15:09 EST 2019. Contains 329896 sequences. (Running on oeis4.)