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.

A271779 a(n) = n^3 + 2*n^2 + 5*n + 11.

This page as a plain text file.
%I A271779 #15 Sep 08 2022 08:46:16
%S A271779 11,19,37,71,127,211,329,487,691,947,1261,1639,2087,2611,3217,3911,
%T A271779 4699,5587,6581,7687,8911,10259,11737,13351,15107,17011,19069,21287,
%U A271779 23671,26227,28961,31879,34987,38291,41797,45511,49439,53587,57961,62567,67411,72499
%N A271779 a(n) = n^3 + 2*n^2 + 5*n + 11.
%H A271779 Roman Witula, Damian Slota and Adam Warzynski, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL9/Slota/slota57.html">Quasi-Fibonacci Numbers of the Seventh Order</a>, J. Integer Seq., 9 (2006), Article 06.4.3, page 24.
%H A271779 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1).
%F A271779 O.g.f.: (11 - 25*x + 27*x^2 - 7*x^3)/(1 - x)^4.
%F A271779 E.g.f.: (11 + 8*x + 5*x^2 + x^3)*exp(x).
%F A271779 a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) for n>3.
%t A271779 Table[n^3 + 2 n^2 + 5 n + 11, {n, 0, 50}]
%o A271779 (Magma) [n^3+2*n^2+5*n+11: n in [0..50]];
%o A271779 (PARI) vector(50, n, n--; n^3+2*n^2+5*n+11) \\ _Altug Alkan_, Apr 14 2016
%Y A271779 Subsequence of A001651, A032793.
%K A271779 nonn,easy
%O A271779 0,1
%A A271779 _Vincenzo Librandi_, Apr 14 2016