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.
%I A243140 #25 Aug 10 2015 17:48:07 %S A243140 22,26,38,55,62,88,95,102,104,108,116,122,126,138,162,174,202,206,218, %T A243140 234,258,410,414,430,442,474,586,826,922,1318,1342,1366,1474,1586, %U A243140 1826,1922,1958,2318,2366,2582,2742,3174,3258,3498,4362 %N A243140 Numbers n such that n appears in the sequence beginning with the digit-product of n and extended by adding successive digit-products. %C A243140 Numbers n>9 with following property: form a sequence b(i) whose initial term is digit-product(n). Later terms are given by the rule that b(i) = b(i-1) + digit-product(b(i-1)) and n itself appears in the sequence. %C A243140 The function digit-product(n) multiplies all nonzero digits of n (A051801). For example, digit-product(1230) = 1 * 2 * 3 = 6. The resultant sequence appears in A063114, n + product of nonzero digits of n. %H A243140 Charles R Greathouse IV, <a href="/A243140/b243140.txt">Table of n, a(n) for n = 1..1000</a> %F A243140 b(i) = b(i-1) + digit-product(b(i-1)). %e A243140 The digit-product sequence for 22 begins with digit-product(22)= 4, 4 + 4 = 8, 8 + 8 = 16, 16 + 6 = 22. Since this procedure returns to the initial number 22, it belongs here. %e A243140 The digit-product sequence for 102 begins with 2, 2 + 2 = 4, 4 + 4 = 8, 8 + 8 = 16, 16 + 6 = 22, 22 + 4 = 26, 26 + 12 = 38, 38 + 24 = 62, 62 + 12 = 74, 74 + 28 = 102. Since this procedure returns to the initial number 102, it belongs here. %o A243140 (PARI) dp(n)=my(v=select(k->k>1,digits(n))); prod(i=1,#v,v[i]) %o A243140 is(n)=my(t=dp(n)); until(t>=n, t+=dp(t)); t==n \\ _Charles R Greathouse IV_, Jun 05 2014 %Y A243140 Cf. A007629, A243021, A051801, A063114. %K A243140 nonn,base %O A243140 1,1 %A A243140 _Anthony Sand_, May 30 2014