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.

A168388 First number in the n-th row of A172002.

This page as a plain text file.
%I A168388 #14 Sep 08 2022 08:45:49
%S A168388 1,3,5,13,21,39,57,89,121,171,221,293,365,463,561,689,817,979,1141,
%T A168388 1341,1541,1783,2025,2313,2601,2939,3277,3669,4061,4511,4961,5473,
%U A168388 5985,6563,7141,7789,8437,9159,9881,10681,11481,12363,13245,14213,15181,16239,17297
%N A168388 First number in the n-th row of A172002.
%H A168388 Harvey P. Dale, <a href="/A168388/b168388.txt">Table of n, a(n) for n = 1..1000</a>
%H A168388 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (2, 1, -4, 1, 2, -1).
%F A168388 a(2*n+1) = A166464(n)        a(2*n) = A166911(n).
%F A168388 a(n+1) - a(n) = A093907(n-1), n>1.
%F A168388 a(n) = 2*a(n-1) +a(n-2) -4*a(n-3) +a(n-4) +2*a(n-5) -a(n-6).
%F A168388 G.f.: x*(1 - x^2 + 2*x)*(1 - x + x^2 + x^3)/( (1+x)^2 * (x-1)^4).
%F A168388 a(n+1) = A168380(n)+1.
%F A168388 From _G. C. Greubel_, Jul 19 2016: (Start)
%F A168388 a(n) = (12 + n + 3*(-1)^n*n + 2*n^3)/12.
%F A168388 E.g.f.: (1/12)*( -3*x - 12*exp(x) + (12 + 3*x + 6*x^2 + 2*x^3)*exp(2*x) )*exp(-x). (End)
%t A168388 LinearRecurrence[{2,1,-4,1,2,-1},{1,3,5,13,21,39},50] (* _Harvey P. Dale_, Nov 29 2014 *)
%t A168388 Table[(n + 1) (3 + 2 n^2 + 4 n - 3 (-1)^n)/12 + 1, {n, 0, 46}] (* _Michael De Vlieger_, Jul 19 2016, after _Vincenzo Librandi_ at A168380 *)
%o A168388 (Magma) [(12+n+3*(-1)^n*n+2*n^3)/12: n in [1..60]]; // _Vincenzo Librandi_, Jul 20 2016
%Y A168388 Cf. A168234.
%K A168388 nonn,easy
%O A168388 1,2
%A A168388 _Paul Curtz_, Nov 24 2009
%E A168388 Edited and extended by _R. J. Mathar_, Mar 25 2010