Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #6 Jan 16 2018 02:46:12
%S 420,840,858,1260,1326,1540,1716,1938,1980,2145,2310,2340,2520,2622,
%T 2652,2730,2850,2860,2964,3080,3450,3465,3740,3876,3960,4002,4080,
%U 4290,4350,4420,4560,4620,4650,4692,4845,4940,5005,5100,5244,5394,5460,5544
%N Numbers of the form (h+k)k, where h/k is a fraction in a Farey sequence, that occur as at least two times in a Farey sequence. 420 (13+15)*15=(1+20)*20.
%C This value (h+k)k gives one side of a triangle defined by sides (k^2, (h+k)k, (h+k)^2-k^k) which happens to have the property that the angle opposite the (h+k)k side is twice the measure of the angle opposite the k^2 side. These numbers would be the duplicates in the term-by-term multiplication: A106501 * A106500.
%H N. M. Makin, <a href="/A147775/b147775.txt">Table of n, a(n) for n = 1..5490</a>.
%e a(n) <- (h1,k1),(h2,k2)
%e 420 <- (13,15),(1,20)
%e 840 <- (19,21),(11,24)
%e 858 <- (17,22),(7,26)
%e 2160 <- (17,28),(1,35)
%e 2520 <- (23,40),(11,45)
%t F[n_]:= Union[Flatten[Join[Table[p/q, {q, n}, {p, q - 1}]]]];
%t S[n_]:=(Denominator[n]+Numerator[n])Denominator[n];
%t FindDups[l_]:= Module[{sl,rs},sl=Sort[l];rs={};Map[If[Count[sl,# ]>1,rs=Append[rs,# ]]&,l]; Union[rs]];
%t FindDups[S[F[71]]]
%Y Cf. A007305, A007306, A106500, A106501.
%K nonn
%O 1,1
%A Nicholas M. Makin (nmaximillian(AT)yahoo.com), Nov 12 2008