The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 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

%I

%S 0,1,3,7,15,17,19,21,23,26,29,32,35,39,43,47,52,55,61,63,67,74,79,87,

%T 95,101,102,103,104,105,106,107,108,109,110,111,113,115,117,119,121,

%U 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

%N a(n+1) = a(n) + (smallest digit of a(n)) + 1, a(0)=0.

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

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

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

%Y Cf. A045844.

%K nonn,easy,base

%O 0,3

%A _M. F. Hasler_, Jan 14 2014

%E PARI code corrected by _Colin Barker_, Sep 20 2014

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.

Last modified January 17 23:37 EST 2020. Contains 330995 sequences. (Running on oeis4.)