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 A273057 #13 May 18 2016 11:11:16
%S A273057 8,108,4320,151200,3326400,108108000,10291881600,586637251200,
%T A273057 53970627110400,5869305698256000,667144414368432000,
%U A273057 26928374543598528000,3036174229790734032000,522221967524006253504000,159538811078583910445472000,16911113974329894507220032000,1164048345233041071913645536000,304315495968066451657424475840000,28544793521804633165466415833792000,2026680340048128954748115524199232000
%N A273057 Largest term in A067128 having greatest prime divisor prime(n).
%C A273057 By the theorem of _Vladimir Shevelev_ mentioned in sequence A273015, such an element exists for each prime.
%t A273057 a = {}; b = {0}; Do[If[# >= Max@ b, AppendTo[a, k] && AppendTo[b, #]] &@
%t A273057 DivisorSigma[0, k], {k, 10^7}]; TakeWhile[Table[SelectFirst[Reverse@ a,
%t A273057 FactorInteger[#][[-1, 1]] == Prime@ n &], {n, 6}], # < Max@ a &] (* _Michael De Vlieger_, May 14 2016 *)
%Y A273057 Cf. A273015, A273016, A273018.
%K A273057 nonn
%O A273057 1,1
%A A273057 _David A. Corneth_ and _Vladimir Shevelev_, May 14 2016