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 A180479 #17 Mar 04 2024 01:15:03
%S A180479 1,2,3,4,5,6,7,8,9,10,12,16,20,24,30,32,36,40,48,50,60,64,70,80,90,96,
%T A180479 110,112,132,170,184,220,224,225,252,264,275,312,330,336,340,342,396,
%U A180479 414,418,440,441,448,510,550,621,624,660,665,680,684,770,812,825,828
%N A180479 Numbers m such that m/k is an integer. m = (x_1 x_2 ... x_r) where x_i are digits of m, k = x_1*r + x_2*(r-1) + ... + x_r*1.
%C A180479 From _Michel Marcus_, Aug 18 2015: (Start)
%C A180479 Integers m such that m and m+1 are in the sequence: 1, 2, 3, 4, 5, 6, 7, 8, 9, 224, 440, 2046, 3604, 4255, 6255, 10511, 11190, ...
%C A180479 Integers m such that m, m+1 and m+2 are in the sequence: 1, 2, 3, 4, 5, 6, 7, 8, 140607, 411904, 1099448, 1101150, 2109074, 2110158, ...
%C A180479 (End)
%H A180479 Paolo P. Lava, <a href="/A180479/b180479.txt">Table of n, a(n) for n = 1..10000</a>
%e A180479 For m=132, r=3, 132/(1*3+3*2+2*1)=12, so m=132 belongs to the sequence.
%t A180479 Select[Range[1000], Mod[#, Total[ IntegerDigits[#] Reverse@ Range@ IntegerLength@ #]] == 0 &] (* _Giovanni Resta_, Aug 18 2015 *)
%o A180479 (PARI) isok(n) = {my(d = digits(n)); ! (n % sum(kk=1, #d, d[kk]*(#d-kk+1)));} \\ _Michel Marcus_, Aug 18 2015
%Y A180479 Cf. A005349, A007602, A180468.
%K A180479 base,easy,nonn
%O A180479 1,2
%A A180479 _Ctibor O. Zizka_, Sep 07 2010