cp's OEIS Frontend

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.

A249766 Numbers n = concat(s,t) such that s and t divide n.

This page as a plain text file.
%I A249766 #13 Nov 20 2014 13:13:32
%S A249766 11,12,15,22,24,33,36,44,48,55,66,77,88,99,101,102,104,105,110,120,
%T A249766 125,150,202,204,208,210,220,240,250,303,306,312,315,330,360,375,404,
%U A249766 408,416,420,440,480,505,510,520,525,550,606,612,624,630,660,707,714,728
%N A249766 Numbers n = concat(s,t) such that s and t divide n.
%C A249766 Subset of A038770 and A139138.
%H A249766 Paolo P. Lava, <a href="/A249766/b249766.txt">Table of n, a(n) for n = 1..1000</a>
%e A249766 306 = concat(3, 06) and 306 / 3 = 102 and 306 / 6 = 51.
%e A249766 76152 = concat(76, 152) and 76152 / 76 = 1002 and 76152 / 152 = 501.
%p A249766 with(numtheory):P:=proc(q) local a,b,k,n;
%p A249766 for n from 1 to q do for k from 1 to ilog10(n) do a:=n mod 10^k; b:=trunc(n/10^k);
%p A249766 if a*b>0 then if type(n/a,integer) and type(n/b,integer) then print(n); break;
%p A249766 fi; fi; od; od; end: P(10^6);
%Y A249766 Cf. A038770, A139138.
%K A249766 nonn,base
%O A249766 1,1
%A A249766 _Paolo P. Lava_, Nov 05 2014