A164836 a(n) is the number such that every k-digit substring ( k <= n ) taken from the right end, is divisible by k.
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 102, 108, 114, 120, 126, 132, 138, 144, 150, 156, 162, 168, 174, 180
Offset: 1
Examples
144 is a member of the sequence since 4 is divisible by 1, 44 is divisible by 2 and 144 is divisible by 3. For 30-digit number 177723702519951630930135507600 we have: 1 | 0, 2 | 0, 3 | 600, 4 | 7600, 5 | 7600, 6 | 507600, ... [_Jaroslav Krizek_, Feb 19 2010]
Programs
-
Mathematica
ekdsQ[n_]:=Module[{idn=IntegerDigits[n]},And@@Table[Divisible[ FromDigits[ Take[ idn,-k]],k],{k,IntegerLength[n]}]]; Select[Range[0,200],ekdsQ] (* Harvey P. Dale, Nov 11 2017 *)