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 A190760 #11 Mar 04 2015 20:55:06 %S A190760 0,1,2,3,4,5,6,7,8,9,10,12,14,16,18,20,21,22,23,24,25,26,27,28,29,30, %T A190760 32,34,36,38,40,41,42,43,44,45,46,47,48,49,50,52,54,56,58,60,61,62,63, %U A190760 64,65,66,67,68,69,70,72,74,76,78,80,81,82,83,84,85,86,87,88,89,90,92,94,96,98,100,101,102,103,104,105,106,107,108,109,110,113,116,119 %N A190760 Product of digits is divisible by number of digits. %C A190760 Almost all numbers are in this sequence: there are at least n - 1.125 n^0.95... elements up to n, where the exponent is log(9)/log(10). - _Charles R Greathouse IV_, May 20 2011 %H A190760 Nathaniel Johnston, <a href="/A190760/b190760.txt">Table of n, a(n) for n = 1..10000</a> %e A190760 3*8*2 = 48 and 48 is divisible by the number of digits, 3, so 382 is included. %p A190760 A190760 := proc(n) option remember: local k: if(n=1)then return 0: fi: for k from procname(n-1)+1 do if(mul(d,d=convert(k,base,10)) mod length(k) = 0)then return k: fi: od: end: seq(A190760(n),n=1..100); # _Nathaniel Johnston_, May 19 2011 %Y A190760 Cf. A007954, A055642, A061383. %K A190760 nonn,base,easy %O A190760 1,3 %A A190760 _Kyle Stern_, May 18 2011