login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A123363 a(n) = n^3 + (-1)^(n+1). 1

%I #13 Sep 08 2022 08:45:28

%S -1,2,7,28,63,126,215,344,511,730,999,1332,1727,2198,2743,3376,4095,

%T 4914,5831,6860,7999,9262,10647,12168,13823,15626,17575,19684,21951,

%U 24390,26999,29792,32767,35938,39303,42876,46655,50654,54871,59320,63999

%N a(n) = n^3 + (-1)^(n+1).

%H G. C. Greubel, <a href="/A123363/b123363.txt">Table of n, a(n) for n = 0..1000</a>

%H <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (3,-2,-2,3,-1).

%F G.f.: ( -1+5*x-x^2+9*x^3 ) / ( (1+x)*(x-1)^4 ). - _R. J. Mathar_, Aug 06 2012

%F E.g.f.: x*(1 + 3*x + x^2)*exp(x) - exp(-x). - _G. C. Greubel_, Oct 12 2017

%t CoefficientList[Series[(-1 + 5*x - x^2 + 9*x^3)/((1 + x)*(x - 1)^4), {x, 0, 50}], x] (* _G. C. Greubel_, Oct 12 2017 *)

%o (PARI) for(n=0,50, print1(n^3 + (-1)^(n+1), ", ")) \\ _G. C. Greubel_, Oct 12 2017

%o (Magma) [n^3 + (-1)^(n+1): n in [0..50]]; // _G. C. Greubel_, Oct 12 2017

%K sign,easy

%O 0,2

%A Chenxing (cxwind(AT)gmail.com), Oct 12 2006

%E Corrected and extended by _N. J. A. Sloane_, Oct 14 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 15:34 EDT 2024. Contains 371794 sequences. (Running on oeis4.)