|
%I #25 Dec 23 2021 09:38:09
%S 1,144,43,120,80,60,5,390,87,58,56,42,9,6,160,108,72,48,4,186,124,93,
%T 100,75,90,103,114,76,57,148,111,132,104,78,117,180,110,88,96,64,176,
%U 192,126,175,140,130,195,300,98,384,153,102,68,85,204,216,162,135,234,252,168,315,150,200,420,224,432,159,106,477,906,360,330,209,342,513,266,684,152,460,138,92,69
%N Similar to A173065 but without the constraint that the sequence be increasing.
%C The sequence was computed by _D. S. McNeil_.
%C Comments on A173713 and A173065 from _Jack Brennen_, Sep 21 2010: (Start)
%C Note that the sequence A173713 reaches 9-digit numbers fairly quickly, at index 451, but out to index 12000, it still does not reach 10-digit numbers.
%C The sequence A173065 (strictly increasing) seems to grow fairly slowly, with occasional big jumps, which isn't really surprising, I guess. It reaches 9-digit numbers at index 8060, and then grows very slowly.
%C The fact that 9-digit numbers usually get the job done is due to the relative abundance of divisors of 10^9 + 1 (32 divisors).
%C Note that 10^15 + 1 has 128 divisors, and so it seems very unlikely to me that you could ever reasonably calculate the sequence far enough to the point where 15-digit numbers would not suffice... (End)
%D Eric Angelini, Posting to Sequence Fans Mailing List, Sep 21 2010
%H Eric Angelini, <a href="http://www.cetteadressecomportecinquantesignes.com/DiffDivConcat.htm">|a-b| divides concatenation [ab]</a>
%H E. Angelini, <a href="/A173065/a173065.pdf">|a-b| divides concatenation [ab]</a> [Cached copy, with permission]
%H Jack Brennen, <a href="/A173713/a173713.txt">PARI Program</a>
%Y Cf. A173065.
%K nonn
%O 1,2
%A _N. J. A. Sloane_, Nov 25 2010
|
