cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A235698 #15 Sep 27 2014 19:08:21
%S A235698 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 A235698 95,101,102,103,104,105,106,107,108,109,110,111,113,115,117,119,121,
%U A235698 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 A235698 a(n+1) = a(n) + (smallest digit of a(n)) + 1, a(0)=0.
%C A235698 It is obvious why the "+ 1" has to be there.
%C A235698 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 A235698 (PARI) print1(0", "a=1); for(i=1, 99, print1(", ", a+=vecmin(digits(a))+1))
%Y A235698 Cf. A045844.
%K A235698 nonn,easy,base
%O A235698 0,3
%A A235698 _M. F. Hasler_, Jan 14 2014
%E A235698 PARI code corrected by _Colin Barker_, Sep 20 2014