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!)
A100606 a(n) = n^4 + n^3 + n. 1

%I #12 Oct 21 2022 21:21:36

%S 0,3,26,111,324,755,1518,2751,4616,7299,11010,15983,22476,30771,41174,

%T 54015,69648,88451,110826,137199,168020,203763,244926,292031,345624,

%U 406275,474578,551151,636636,731699,837030,953343,1081376,1221891

%N a(n) = n^4 + n^3 + n.

%H Vincenzo Librandi, <a href="/A100606/b100606.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 (5, -10, 10, -5, 1).

%F a(n) = 5*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5); a(0)=0, a(1)=3, a(2)=26, a(3)=111, a(4)=324. - _Harvey P. Dale_, Apr 25 2015

%t Table[n^4+n^3+n,{n,0,40}] (* or *) LinearRecurrence[{5,-10,10,-5,1},{0,3,26,111,324},40] (* _Harvey P. Dale_, Apr 25 2015 *)

%o (Magma) [n^4+n^3+n: n in [0..50]]; // _Vincenzo Librandi_, Jun 09 2011

%o (PARI) a(n)=n^4+n^3+n \\ _Charles R Greathouse IV_, Oct 21 2022

%Y Cf. A000583, A002523, A091940, A071253, A059826, A027445, A053699, A100019.

%K nonn,easy

%O 0,2

%A Douglas Winston (douglas.winston(AT)srupc.com), Nov 30 2004

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 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)