The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #39 Oct 20 2022 05:05:01
%S 1,11,12,124,135,1111,1525,13515,124816,1223462,12356910,13919571,
%T 1210320658,1243162124,1525125625,12346121028,12478141928,12510153130,
%U 12510254150,1234689111216,1351553159265,1597717414885,1713913539247,12356910151830,13791121336377
%N Integers m whose decimal expansion is a prefix of the concatenation of the divisors of m.
%C This is different from A175252 in that the digits to be concatenated can end in the middle of a divisor.
%C All terms start with the digit 1. - _Chai Wah Wu_, Sep 23 2022
%C a(26) > 10^14. - _Giovanni Resta_, Oct 20 2022
%e 11 is a term since its divisors are 1 and 11 whose concatenation is 111 whose first 2 digits are 11.
%e 1111 is a term since its divisors are 1, 11, 101, and 1111 whose concatenation is 1111011111 whose first 4 digits are 1111.
%t q[n_] := (Join @@ IntegerDigits @ Divisors[n])[[1 ;; Length @ (d = IntegerDigits[n])]] == d; Select[Range[1.3*10^6], q] (* _Amiram Eldar_, Sep 22 2022 *)
%o (PARI) f(n) = my(s=""); fordiv(n, d, s = concat(s, Str(d))); s; \\ A037278
%o isok(k) = if (k==1, 1, my(v=strsplit(f(k), Str(k))); (v[1] == ""));
%o (Python)
%o from sympy import divisors
%o def ok(n): return "".join(str(d) for d in divisors(n)).startswith(str(n))
%o print([k for k in range(10**5) if ok(k)]) # _Michael S. Branicky_, Sep 22 2022
%o (Python)
%o from itertools import count, islice
%o from sympy import divisors
%o def A357273_gen(): # generator of terms
%o yield 1
%o for n in count(1):
%o r = str(n)
%o if n&1 or r.startswith('2'):
%o m = 10**(c:=len(r))+n
%o s, sm = '', str(m)
%o for d in divisors(m):
%o s += str(d)
%o if len(s) >= c+1:
%o break
%o if s.startswith(sm):
%o yield m
%o A357273_list = list(islice(A357273_gen(),10)) # _Chai Wah Wu_, Sep 23 2022
%Y Cf. A037278, A175252 (a subsequence).
%Y Cf. A004022 (a subsequence).
%Y Subsequence of A131835.
%K nonn,base
%O 1,2
%A _Michel Marcus_, Sep 22 2022
%E a(16)-a(25) from _Giovanni Resta_, Oct 20 2022