|
| |
| |
|
|
|
1, 1, 5, 19, 49, 101, 181, 295, 449, 649, 901, 1211, 1585, 2029, 2549, 3151, 3841, 4625, 5509, 6499, 7601, 8821, 10165, 11639, 13249, 15001, 16901, 18955, 21169, 23549, 26101, 28831, 31745, 34849, 38149, 41651, 45361, 49285, 53429, 57799, 62401, 67241, 72325
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| Appears to be the number of possible distinct sums of a set of n distinct integers between 1 and n^2. checked up to n=6. [From Dylan Hamilton (PhalarisBull(AT)gmail.com), Sep 21 2010]
|
|
|
REFERENCES
| T. A. Gulliver, Sequences from Cubes of Integers, Int. Math. Journal, 4 (2003), 439-445.
|
|
|
FORMULA
| a(0)=1, a(1)=1, a(2)=5, a(3)=19, a(n)=4*a(n-1)-6*a(n-2)+4*a(n-3)-a(n-4) [From Harvey P. Dale, Sep 11 2011]
G.f.: (x^3+7*x^2-3*x+1)/(x-1)^4 [From Harvey P. Dale, Sep 11 2011]
|
|
|
MATHEMATICA
| f[n_]:=n^3-n^2+1; Table[f[n], {n, 5!}] [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Feb 07 2010]
Array[#^3-#^2+1&, 50, 0] (* or *) LinearRecurrence[{4, -6, 4, -1}, {1, 1, 5, 19}, 50] (* From Harvey P. Dale, Sep 11 2011 *)
|
|
|
CROSSREFS
| Cf. A162611 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), May 27 2010]
Sequence in context: A045458 A120289 A024191 * A015650 A200764 A055365
Adjacent sequences: A100101 A100102 A100103 * A100105 A100106 A100107
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Jan 12 2005
|
| |
|
|
