login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A100019
a(n) = n^4 + n^3 + n^2.
11
0, 3, 28, 117, 336, 775, 1548, 2793, 4672, 7371, 11100, 16093, 22608, 30927, 41356, 54225, 69888, 88723, 111132, 137541, 168400, 204183, 245388, 292537, 346176, 406875, 475228, 551853, 637392, 732511, 837900, 954273, 1082368, 1222947
OFFSET
0,2
COMMENTS
a(n) are the numbers m such that: j^2 = j + m + sqrt(j*m) with corresponding numbers j given by A002061(n+1), and with sqrt(j*m) = A027444(n) = n* A002061(n+1). - Richard R. Forberg, Sep 03 2013.
LINKS
FORMULA
From Indranil Ghosh, Apr 15 2017: (Start)
G.f.: -x(3 + 13x + 7x^2 + x^3)/(x - 1)^5
E.g.f.: exp(x)*x*(3 + 11x + 7x^2 + x^3)
(End)
MAPLE
A100019:=n->n^4+n^3+n^2: seq(A100019(n), n=0..50); # Wesley Ivan Hurt, Apr 14 2017
MATHEMATICA
f[n_]:=n^4+n^3+n^2; Array[f, 50, 0] (* Vladimir Joseph Stephan Orlovsky, Apr 12 2011 *)
PROG
(Magma) [n^4+n^3+n^2: n in [0..50]]; // Vincenzo Librandi, Jun 09 2011
(PARI) a(n) = n^4 + n^3 + n^2 \\ Indranil Ghosh, Apr 15 2017
KEYWORD
nonn,easy
AUTHOR
Douglas Winston (douglas.winston(AT)srupc.com), Nov 19 2004
STATUS
approved