login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A190760
Product of digits is divisible by number of digits.
1
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, 32, 34, 36, 38, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 52, 54, 56, 58, 60, 61, 62, 63, 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
OFFSET
1,3
COMMENTS
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
LINKS
EXAMPLE
3*8*2 = 48 and 48 is divisible by the number of digits, 3, so 382 is included.
MAPLE
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
CROSSREFS
KEYWORD
nonn,base,easy
AUTHOR
Kyle Stern, May 18 2011
STATUS
approved