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 A261448 #24 Mar 13 2018 04:09:02 %S A261448 101,102,104,105,110,120,125,150,201,202,204,205,208,210,220,225,240, %T A261448 250,301,302,303,304,305,306,310,312,315,320,325,330,350,360,375,401, %U A261448 402,404,405,408,410,416,420,425,440,450,480,501,502,504,505,510,520,525,550 %N A261448 Numbers n >= 100 that are divisible by n mod 100. %C A261448 This sequence can be seen as the union of 99 linear sequences of the form a_i*k+i, for i=1,...,99 and k>0, where a_i depends on i. For example, 100*k+1, 100*k+2, 300*k+3,..., 4700*k+94, 1900*k+95,..., 9900*k+99. Hence, in analogy with A034709, there exist two numbers p and q such that a(p*k+i) = q*k + a(i), where q <= lcm(1,2,...,99). - _Giovanni Resta_, Aug 20 2015 %t A261448 Select[Range[100, 1000], Quiet@ Divisible[#, Mod[#, 100]] &] (* _Giovanni Resta_, Aug 19 2015 *) %o A261448 (PARI) isok(n) = (n>100) && (dd = n % 100) && !(n % dd); \\ _Michel Marcus_, Aug 19 2015 %Y A261448 Cf. A034709, A178158. %K A261448 nonn,base,easy %O A261448 1,1 %A A261448 _Giovanni Teofilatto_, Aug 19 2015 %E A261448 More terms from _Michel Marcus_, Aug 19 2015