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!)
A127873 a(n) = (n^3)/2 + (3*n^2)/2 + 3*n + 3. 11
8, 19, 39, 71, 118, 183, 269, 379, 516, 683, 883, 1119, 1394, 1711, 2073, 2483, 2944, 3459, 4031, 4663, 5358, 6119, 6949, 7851, 8828, 9883, 11019, 12239, 13546, 14943, 16433, 18019, 19704, 21491, 23383, 25383, 27494, 29719, 32061, 34523, 37108 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Generating polynomial is Schur's polynomial of degree 3. Schur's n-degree polynomials are the first n terms of the series expansion of the e^x function. All polynomials are irreducible and belong to the An alternating Galois transitive group if n is divisible by 4 or to the Sn symmetric Galois Group otherwise (proof: Schur, 1930).
Number of terms < 10^k: 0, 1, 4, 11, 26, 57, 124, 270, 583, 1258, 2713, 5847, 12598, 27143, 58479, ... - Muniru A Asiru, Jan 13 2018
LINKS
FORMULA
G.f.: x*(8-13*x+11*x^2-3*x^3)/(1-x)^4. - Colin Barker, Apr 17 2012
MAPLE
A127873 := [seq((n^3)/2+(3*n^2)/2+3*n+3, n=1..10^3)]; # Muniru A Asiru, Jan 13 2018
MATHEMATICA
Table[3 + 3 x + (3 x^2)/2 + x^3/2, {x, 41}]
Rest@ CoefficientList[ Series[-x (3 x^3 -11 x^2 +13 x - 8)/(x -1)^4, {x, 0, 41}], x] (* or *)
LinearRecurrence[{4, -6, 4, -1}, {8, 19, 39, 71}, 41] (* Robert G. Wilson v, Jan 06 2018 *)
PROG
(PARI) a(n)=n^3/2+3*n*(n+2)/2+3 \\ Charles R Greathouse IV, May 15 2013
(GAP) A127873 := List([1..10^3], n->(n^3)/2+(3*n^2)/2+3*n+3); # Muniru A Asiru, Jan 13 2018
(Magma) [(n^3)/2 + (3*n^2)/2 + 3*n + 3: n in [0..50]]; // Vincenzo Librandi, Jan 14 2018
CROSSREFS
Cf. A127874.
Sequence in context: A045557 A289877 A089111 * A192975 A156198 A278947
KEYWORD
nonn,easy
AUTHOR
Artur Jasinski, Feb 04 2007
STATUS
approved

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 16 02:40 EDT 2024. Contains 371696 sequences. (Running on oeis4.)