cp's OEIS Frontend

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.

A282284 Least common multiple of 3*n+1 and 3*n-1.

This page as a plain text file.
%I A282284 #11 Sep 05 2020 19:35:10
%S A282284 1,4,35,40,143,112,323,220,575,364,899,544,1295,760,1763,1012,2303,
%T A282284 1300,2915,1624,3599,1984,4355,2380,5183,2812,6083,3280,7055,3784,
%U A282284 8099,4324,9215,4900,10403,5512,11663,6160,12995,6844,14399,7564,15875,8320,17423
%N A282284 Least common multiple of 3*n+1 and 3*n-1.
%H A282284 Colin Barker, <a href="/A282284/b282284.txt">Table of n, a(n) for n = 0..1000</a>
%H A282284 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (0,3,0,-3,0,1).
%F A282284 a(n) = 9*n^2-1 for n>0 and even.
%F A282284 a(n) = (9*n^2-1)/2 for n odd.
%F A282284 a(n) = 3*a(n-2) - 3*a(n-4) + a(n-6) for n>6.
%F A282284 G.f.: (1+4*x+32*x^2+28*x^3+41*x^4+4*x^5-2*x^6) / ((1-x)^3*(1+x)^3).
%t A282284 Table[LCM@@{3n+1,3n-1},{n,0,50}] (* or *) LinearRecurrence[{0,3,0,-3,0,1},{1,4,35,40,143,112,323},60] (* _Harvey P. Dale_, Sep 05 2020 *)
%o A282284 (PARI) vector(60, n, n--; lcm(3*n+1, 3*n-1))
%o A282284 (PARI) Vec((1+4*x+32*x^2+28*x^3+41*x^4+4*x^5-2*x^6) / ((1-x)^3*(1+x)^3) + O(x^60))
%Y A282284 Cf. A000466, A136017, A141759, A282285, A282286.
%K A282284 nonn,easy
%O A282284 0,2
%A A282284 _Colin Barker_, Feb 11 2017