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 A278441 #9 Dec 01 2016 03:12:45 %S A278441 1,2,5,10,22,26,32,62,91,330,370,519,575,710,1060,4055,29377,79554, %T A278441 108690,150320,306440,2510048,3605570,14233221,14331231,14333110, %U A278441 14509410,15143331,15233221,15331231,15333110,16143331,16153331,16233221,16331231,16333110,17143331 %N A278441 Numbers n such that n | A244112(n). %C A278441 The sequence is bounded. See comment in A278439. %H A278441 Paolo P. Lava, <a href="/A278441/a278441.txt"> List of terms and corresponding ratios for n <= 10^9. </a> %e A278441 A244112(519) = 191511 and 191511 / 519 = 369. %p A278441 with(numtheory): P:=proc(q) local a,b,c,d,j,k,n; for n from 1 to q do a:=sort(convert(n,base,10)); %p A278441 for k from 1 to trunc(nops(a)/2) do c:=a[k]; a[k]:=a[nops(a)-k+1]; a[nops(a)-k+1]:=c; od; k:=1; b:=a[1]; c:=0; %p A278441 for j from 2 to nops(a) do if a[j]=b then k:=k+1; else d:=10*k+b; c:=c*10^(ilog10(d)+1)+d; k:=1; b:=a[j]; fi; od; %p A278441 d:=10*k+b; c:=c*10^(ilog10(d)+1)+d; if type(c/n,integer) then print(n); fi; od; end: P(10^99); %Y A278441 Cf. A237605, A244112, A278439, A278440. %K A278441 nonn,easy,base,fini %O A278441 1,2 %A A278441 _Paolo P. Lava_, Nov 25 2016