|
|
A033569
|
|
a(n) = (2*n - 1)*(3*n + 1).
|
|
3
|
|
|
-1, 4, 21, 50, 91, 144, 209, 286, 375, 476, 589, 714, 851, 1000, 1161, 1334, 1519, 1716, 1925, 2146, 2379, 2624, 2881, 3150, 3431, 3724, 4029, 4346, 4675, 5016, 5369, 5734, 6111, 6500, 6901, 7314, 7739, 8176, 8625, 9086, 9559, 10044, 10541, 11050, 11571
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
For n>0, a(n) is the sum of the numbers from 2n+2 to 4n. The last digit of a(n) corresponds to the last digit of the squares mod 10 (A008959). Binomial Transform of a(n) starts: -1, 3, 28, 124, 432, 1328, 3776, 10176, 26368, ... . - Wesley Ivan Hurt, Dec 06 2014
|
|
LINKS
|
|
|
FORMULA
|
Sum_{n>=0} 1/a(n) = 2/5*(log(2)-1) -sqrt(3)*Pi/30 -3*log(3)/10 = -0.6337047... - R. J. Mathar, Apr 22 2024
|
|
MAPLE
|
|
|
MATHEMATICA
|
CoefficientList[Series[(-1+7*x+6*x^2)/(1-x)^3, {x, 0, 50}], x] (* Vincenzo Librandi, Jul 07 2012 *)
|
|
PROG
|
(Haskell)
a033569 n = (2 * n - 1) * (3 * n + 1)
a033569_list = map a033569 [0..]
(Sage) [(2*n-1)*(3*n+1) for n in (0..50)] # G. C. Greubel, Apr 02 2019
(GAP) List([0..50], n-> (2*n-1)*(3*n+1)) # G. C. Greubel, Apr 02 2019
|
|
CROSSREFS
|
|
|
KEYWORD
|
sign,easy,changed
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|