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 A282286 #8 Feb 11 2017 16:03:27 %S A282286 1,24,195,220,783,612,1763,1200,3135,1984,4899,2964,7055,4140,9603, %T A282286 5512,12543,7080,15875,8844,19599,10804,23715,12960,28223,15312,33123, %U A282286 17860,38415,20604,44099,23544,50175,26680,56643,30012,63503,33540,70755,37264,78399 %N A282286 Least common multiple of 7*n+1 and 7*n-1. %H A282286 Colin Barker, <a href="/A282286/b282286.txt">Table of n, a(n) for n = 0..1000</a> %H A282286 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (0,3,0,-3,0,1). %F A282286 a(n) = 49*n^2-1 for n>0 and even. %F A282286 a(n) = (49*n^2-1)/2 for n odd. %F A282286 a(n) = 3*a(n-2) - 3*a(n-4) + a(n-6) for n>6. %F A282286 G.f.: (1+24*x+192*x^2+148*x^3+201*x^4+24*x^5-2*x^6) / ((1-x)^3*(1+x)^3). %o A282286 (PARI) vector(60, n, n--; lcm(7*n+1, 7*n-1)) %o A282286 (PARI) Vec((1+24*x+192*x^2+148*x^3+201*x^4+24*x^5-2*x^6) / ((1-x)^3*(1+x)^3) + O(x^60)) %Y A282286 Cf. A000466, A136017, A141759, A282284, A282285. %K A282286 nonn,easy %O A282286 0,2 %A A282286 _Colin Barker_, Feb 11 2017