|
|
A261448
|
|
Numbers n >= 100 that are divisible by n mod 100.
|
|
0
|
|
|
101, 102, 104, 105, 110, 120, 125, 150, 201, 202, 204, 205, 208, 210, 220, 225, 240, 250, 301, 302, 303, 304, 305, 306, 310, 312, 315, 320, 325, 330, 350, 360, 375, 401, 402, 404, 405, 408, 410, 416, 420, 425, 440, 450, 480, 501, 502, 504, 505, 510, 520, 525, 550
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
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
|
|
LINKS
|
|
|
MATHEMATICA
|
Select[Range[100, 1000], Quiet@ Divisible[#, Mod[#, 100]] &] (* Giovanni Resta, Aug 19 2015 *)
|
|
PROG
|
(PARI) isok(n) = (n>100) && (dd = n % 100) && !(n % dd); \\ Michel Marcus, Aug 19 2015
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|