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 A276705 #10 Jul 30 2025 13:59:15
%S A276705 4,5,7,8,9,20,55,91,187,247,391,475,667,775,1015,1147,1435,1591,1927,
%T A276705 2107,2491,2695,3127,3355,3835,4087,4615,4891,5467,5767,6391,6715,
%U A276705 7387,7735,8455,8827,9595,9991,10807,11227,12091,12535,13447,13915,14875,15367
%N A276705 Records in A249860.
%C A276705 The indices corresponding to the records are in A276706.
%F A276705 Conjectures: (Start)
%F A276705 a(n) = (347+27*(-1)^n)/2 - 3*(27+(-1)^n)*n + 9*n^2 for n>6.
%F A276705 a(n) = a(n-1)+2*a(n-2)-2*a(n-3)-a(n-4)+a(n-5) for n>11.
%F A276705 G.f.: x*(4+x-6*x^2-x^3+x^4+10*x^5+35*x^6+15*x^7+27*x^8-x^9-13*x^10) / ((1-x)^3*(1+x)^2).
%F A276705 (End)
%t A276705 DeleteDuplicates[Table[LCM@@(n+{-3,3}),{n,200}],GreaterEqual] (* _Harvey P. Dale_, Jul 30 2025 *)
%o A276705 (PARI) lista(nn) = {rec = 0; for (n=1, nn, an = lcm(n-3, n+3); if (an > rec, rec = an; print1(rec, ", ")););} \\ _Michel Marcus_, Sep 16 2016
%Y A276705 Cf. A249860, A276704, A276706.
%K A276705 nonn
%O A276705 1,1
%A A276705 _Colin Barker_, Sep 15 2016