A317617 -id:A317617 - cp's OEIS frontend

A037270 a(n) = n^2*(n^2 + 1)/2.

0, 1, 10, 45, 136, 325, 666, 1225, 2080, 3321, 5050, 7381, 10440, 14365, 19306, 25425, 32896, 41905, 52650, 65341, 80200, 97461, 117370, 140185, 166176, 195625, 228826, 266085, 307720, 354061, 405450, 462241, 524800, 593505, 668746, 750925, 840456, 937765

Offset: 0

Aaron Gulliver (gulliver(AT)elec.canterbury.ac.nz)

Sum of first n^2 positive integers.
Start from xanthene and attach amino acids according to the reaction scheme that describes the reaction between the active sites. See the hyperlink below on chemistry. - Robert G. Wilson v, Aug 02 2002; Amarnath Murthy, Aug 01 2002
Sum of the next n multiples of n. - Amarnath Murthy, Aug 01 2002
The sum of the terms in an n X n spiral. These are also triangular numbers. - William A. Tedeschi, Feb 27 2008
Hypotenuse of Pythagorean triangles with smallest side a cube: A000578(n)^2 + A083374(n)^2 = a(n)^2. - Martin Renner, Nov 12 2011
For n>1, triangular numbers that can be represented as a sum of a square and a triangular number. For example, a(2)=10=4+6=9+1. - Ivan N. Ianakiev, Apr 24 2012
A037270 can be constructed in the following manner: Take A000217 and for every n not in A000290 delete the corresponding A000217(n). - Ivan N. Ianakiev, Apr 26 2012
Starting at a(1)=1 simply take 1*1=1, a(2)= 2*(2+3)=10, a(3)= 3*(4+5+6)=45, a(4)=4*(7+8+9+10) and so on. - J. M. Bergot, May 01 2015
Observation: The digital roots of the terms repeat in the sequence 1, 1, 9; e.g., the digital roots of 1, 10, 45, 136, 325, and 666 are 1, 1, 9, 1, 1, and 9. Verified for the first 10000 terms. - Rob Barton, Mar 28 2018
The above observation is easily explained and proved given that the digital root of a positive number equals the number modulo 9, and a(n + 9k) == a(n) (mod 9). - M. F. Hasler, Apr 05 2018
Number of unoriented rows of length 4 using up to n colors. For a(0)=0, there are no rows using no colors. For a(1)=1, there is one row using that one color for all positions. For a(2)=10, there are 4 achiral (AAAA, ABBA, BAAB, BBBB) and 6 chiral pairs (AAAB-BAAA, AABA-ABAA, AABB-BBAA, ABAB-BABA, ABBB-BBBA, BABB-BBAB). - Robert A. Russell, Nov 14 2018
For n > 0, a(2n+1) is the number of non-isomorphic 6C_m-snakes, where m = 2n+1 or m = 2n (for n>=2). A kC_n-snake is a connected graph in which the k>=2 blocks are isomorphic to the cycle C_n and the block-cutpoint graph is a path. - Christian Barrientos, May 15 2019
Number of achiral colorings of the edges of a tetrahedron with n available colors. - Robert A. Russell, Sep 07 2019

C. Alsina and R. B. Nelson, Charming Proofs: A Journey into Elegant Mathematics, MAA, 2010. See p. 5.
C. Barrientos, Graceful labelings of cyclic snakes, Ars Combin., 60(2001), 85-96.
Albert H. Beiler, Recreations in the theory of numbers, New York: Dover, (2nd ed.) 1966, p. 106, table 55.
T. A. Gulliver, Sequences from Arrays of Integers, Int. Math. Journal, Vol. 1, No. 4, pp. 323-332, 2002.
T. A. Gulliver, Sequences from Cubes of Integers, Int. Math. Journal, 4 (2003), 439-445.
R. A. Wilson, Cosmic Trigger, epilogue of S.-P. Sirag.

T. D. Noe, Table of n, a(n) for n = 0..1000
J. D. Bell, A translation of Leonhard Euler's "De Quadratis Magicis", E795, arXiv:math/0408230 [math.CO], 2004-2005.
N. G de Bruijn, Some classes of integer-valued functions, Nederl. Akad. Wetensch. Proc, Ser. A, 58 (1955), 363-367. See page 363.
Th. Gruner, A. Kerber, R. Laue, and M. Meringer, Mathematics for Combinatorial Chemistry, In: F. Keil, W. Mackens, H. Voß and J. Wether, Scientific Computing in Chemical Engineering II, Springer, 1999, 74-81.
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).

Cf. A000217, A236770 (see crossrefs).
Row 4 of A277504.
Cf. A000583 (oriented), A083374 (chiral), A000290 (achiral).
Cf. A317617.
Row 3 of A327086 (achiral simplex edge colorings).

a:=List([0..30],n->n^2*(n^2+1)/2); # Muniru A Asiru, Mar 28 2018

[n^2*(n^2 + 1)/2: n in [0..30]] // Stefano Spezia, Jan 15 2019

seq(n^2*(n^2+1)/2,n=0..30); # Muniru A Asiru, Mar 28 2018

Table[ n^2*((n^2 + 1)/2), {n, 0, 30} ]
Table[(1/8) Round[N[Sinh[2 ArcSinh[n]]^2, 100]], {n, 0, 30}] (* Artur Jasinski, Feb 10 2010 *)
LinearRecurrence[{5,-10,10,-5,1},{0,1,10,45,136},30] (* Harvey P. Dale, Aug 03 2014 *)

a(n)=binomial(n^2+1,2) \\ Charles R Greathouse IV, Apr 25 2012

for n in range(0,30): print(n**2*(n**2+1)/2, end=', ') # Stefano Spezia, Jan 10 2019

a(n) = a(n-1) + n^3 + (n-1)^3.
a(n) = A000537(n)+A000537(n-1), i.e., square of sum of first n integers plus square of sum of first n-1 integers. - Henry Bottomley, Oct 15 2001
a(n) = Sum_{k=0..n^2} k. - William A. Tedeschi, Feb 27 2008
a(n) = (1/8)*sinh(2*arcsinh(n)). - Artur Jasinski, Feb 10 2010
G.f.: x*(1+x)*(1+4*x+x^2)/(1-x)^5. - Colin Barker, Mar 22 2012
a(n) = a(n-1) + A005898(n-1). - Ivan N. Ianakiev, May 13 2012
a(n) = 2 * A000217(n-1) * A000217(n) + A000290(n). - Ivan N. Ianakiev, May 26 2012
a(n) = A000217(n^2). - J. M. Bergot, Jun 07 2012
a(n) = 5*a(n-1) -10*a(n-2) +10*a(n-3) -5*a(n-4) +a(n-5) n>4, a(0)=0, a(1)=1, a(2)=10, a(3)=45, a(4)=136. - Yosu Yurramendi, Sep 02 2013
For n>0, a(n) = A000217(n)^2 + A000217(n-1)^2. - Richard R. Forberg, Dec 25 2013
a(n) = T(T(n)) + T(T(n-1)) + T(T(n)-1) + T(T(n-1)-1), where T(n) = A000217(n). - Charlie Marion, Sep 10 2016
a(n) = t(n-3)*t(n)+t(n-1)*t(n+2), with t(n)=A000217(n). - J. M. Bergot, Apr 07 2018
From Robert A. Russell, Nov 14 2018: (Start)
a(n) = (A000583(n) + A000290(n)) / 2 = (n^4 + n^2) / 2.
a(n) = A000583(n) - A083374(n) = A083374(n) + A000290(n).
G.f.: (Sum_{j=1..4} S2(4,j)*j!*x^j/(1-x)^(j+1) + Sum_{j=1..2} S2(2,j)*j!*x^j/(1-x)^(j+1)) / 2, where S2 is the Stirling subset number A008277.
G.f.: Sum_{k=1..4} A145882(4,k) * x^k / (1-x)^5.
E.g.f.: (Sum_{k=1..4} S2(4,k)*x^k + Sum_{k=1..2} S2(2,k)*x^k) * exp(x) / 2, where S2 is the Stirling subset number A008277.
For n>4, a(n) = Sum_{j=1..5} -binomial(j-6,j) * a(n-j). (End)
a(n) = n*A006003(n). - Kritsada Moomuang, Dec 16 2018
For n > 0, a(n) = Sum_{k=1..n} A317617(n,k). - Stefano Spezia, Jan 10 2019
Sum_{n>=1} 1/a(n) = 1 + Pi^2/3 - Pi*coth(Pi) = 1.13652003875929052467672874379... - Vaclav Kotesovec, Jan 21 2019
Sum_{n>=1} (-1)^(n+1)/a(n) = Pi*csch(Pi) + Pi^2/6 - 1. - Amiram Eldar, Nov 02 2021

A317614 a(n) = (1/2)(n^3 + n(n mod 2)).

Original entry on oeis.org

1, 4, 15, 32, 65, 108, 175, 256, 369, 500, 671, 864, 1105, 1372, 1695, 2048, 2465, 2916, 3439, 4000, 4641, 5324, 6095, 6912, 7825, 8788, 9855, 10976, 12209, 13500, 14911, 16384, 17985, 19652, 21455, 23328, 25345, 27436, 29679, 32000, 34481, 37044, 39775, 42592

Offset: 1

Stefano Spezia, Aug 01 2018

Terms are obtained as partial sums in an algorithm for the generation of the sequence of the fourth powers (A000583). Starting with the sequence of the positive integers (A000027), it is necessary to delete every 4th term and to consider the partial sums of the obtained sequence, then to delete every 3rd term, and lastly to consider again the partial sums (see References).
a(n) is the trace of an n X n square matrix M(n) formed by writing the numbers 1, ..., n^2 successively forward and backward along the rows in zig-zag pattern as shown in the examples below. Specifically, M(n) is defined as M[i,j,n] = j + n*(i-1) if i is odd and M[i,j,n] = n*i - j + 1 if i is even, and it has det(M(n)) = 0 for n > 2 (proved).
From Saeed Barari, Oct 31 2021: (Start)
Also the sum of the entries in an n X n matrix whose elements start from 1 and increase as they approach the center. For instance, in case of n=5, the entries of the following matrix sum to 65:
  1 2 3 2 1
  2 3 4 3 2
  3 4 5 4 3
  2 3 4 3 2
  1 2 3 2 1. (End)
The n X n square matrix of the preceding comment is defined as: A[i,j,n] = n - abs((n + 1)/2 - j) - abs((n + 1)/2 - i). - Stefano Spezia, Nov 05 2021

			For n = 1 the matrix M(1) is
  1
with trace Tr(M(1)) = a(1) = 1.
For n = 2 the matrix M(2) is
  1, 2
  4, 3
with Tr(M(2)) = a(2) = 4.
For n = 3 the matrix M(3) is
  1, 2, 3
  6, 5, 4
  7, 8, 9
with Tr(M(3)) = a(3) = 15.

Edward A. Ashcroft, Anthony A. Faustini, Rangaswami Jagannathan, and William W. Wadge, Multidimensional Programming, Oxford University Press 1995, p. 12.
John H. Conway and Richard K. Guy, The Book of Numbers, New York: Springer-Verlag, 1996. See p. 64.
G. Polya, Mathematics and Plausible Reasoning: Induction and analogy in mathematics, Princeton University Press 1990, p. 118.
Shailesh Shirali, A Primer on Number Sequences, Universities Press (India) 2004, p. 106.
James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, Exercise 3.7.3 on pages 122-123.

Stefano Spezia, Table of n, a(n) for n = 0..10000
Alfred Moessner, Eine Bemerkung über die Potenzen der natürlichen Zahlen, München 1952. Sitzungsberichte: 1951,3.
Index entries for linear recurrences with constant coefficients, signature (2,1,-4,1,2,-1).

Cf. A000583, A000027, A186424 (first differences).
Cf. A000578, A000035, A193356, A210378.
Cf. A006003, A317297, A001489, A322844.
Cf. related to the M matrices: A074147 (antidiagonals), A130130 (rank), A241016 (row sums), A317617 (column sums), A322277 (permanent), A323723 (subdiagonal sums), A323724 (superdiagonal sums).

a_n:=List([1..nmax], n->(1/2)*(n^3 + n*RemInt(n, 2)));

List([1..50],n->(1/2)*(n^3+n*(n mod 2))); # Muniru A Asiru, Aug 24 2018

[IsEven(n) select n^3/2 else (n^3+n)/2: n in [1..50]]; // Vincenzo Librandi, Aug 07 2018

a:=n->(1/2)*(n^3+n*modp(n,2)): seq(a(n),n=1..50); # Muniru A Asiru, Aug 24 2018

CoefficientList[Series[1/4 E^-x (1 + 3 E^(2 x) + 6 E^(2 x) x + 2 E^(2 x) x^2), {x, 0, 45}], x]*Table[(k + 1)!, {k, 0, 45}]
CoefficientList[Series[-(1 + x^2)/((-1 + x)*(1 + x)^3), {x, 0, 45}], x]*Table[(k + 1)*(-1)^k, {k, 0, 45}]
CoefficientList[Series[-(1 + x^2)/((-1 + x)^3*(1 + x)), {x, 0, 45}], x]*Table[(k + 1), {k, 0, 45}]
From Robert G. Wilson v, Aug 01 2018: (Start)
a[i_, j_, n_] := If[OddQ@ i, j + n (i - 1), n*i - j + 1]; f[n_] := Tr[Table[a[i, j, n], {i, n}, {j, n}]]; Array[f, 45]
CoefficientList[Series[(x^4 + 2x^3 + 6x^2 + 2x + 1)/((x - 1)^4 (x + 1)^2), {x, 0, 45}], x]
LinearRecurrence[{2, 1, -4, 1, 2, -1}, {1, 4, 15, 32, 65, 108}, 45]
(End)

a(n):=(1/2)*(n^3 + n*mod(n,2))$ makelist(a(n), n, 1, nmax);

Vec(x*(1 + 2*x + 6*x^2 + 2*x^3 + x^4) / ((1 - x)^4*(1 + x)^2) + O(x^40)) \\ Colin Barker, Aug 02 2018

M(i, j, n) = if (i % 2, j + n*(i-1), n*i - j + 1);
a(n) = sum(k=1, n, M(k, k, n)); \\ Michel Marcus, Aug 07 2018

for (n in 1:nmax){
   a <- (n^3+n*n%%2)/2
   output <- c(n, a)
   cat(output, "\n")
}
(MATLAB and FreeMat)
for(n=1:nmax); a=(n^3+n*mod(n,2))/2; fprintf('%d\t%0.f\n',n,a); end

a(n) = (1/2)*(A000578(n) + n*A000035(n)).
a(n) = A006003(n) - (n/2)*(1 - (n mod 2)).
a(n) = Sum_{k=1..n} T(n,k), where T(n,k) = ((n + 1)*k - n)*(n mod 2) + ((n - 1)*k + 1)*(1 - (n mod 2)).
E.g.f.: E(x) = (1/4)*exp(-x)*x*(1 + 3*exp(2*x) + 6*exp(2*x)*x + 2*exp(2*x)*x^2).
L.g.f.: L(x) = -x*(1 + x^2)/((-1 + x)*(1 + x)^3).
H.l.g.f.: LH(x) = -x*(1 + x^2)/((-1 + x)^3*(1 + x)).
Dirichlet g.f.: (1/2)*(Zeta(-3 + s) + 2^(-s)*(-2 + 2^s)*Zeta(-1 + s)).
From Colin Barker, Aug 02 2018: (Start)
G.f.: x*(1 + 2*x + 6*x^2 + 2*x^3 + x^4) / ((1 - x)^4*(1 + x)^2).
a(n) = 2*a(n-1) + a(n-2) - 4*a(n-3) + a(n-4) + 2*a(n-5) - a(n-6) for n>6.
a(n) = n^3/2 for n even.
a(n) = (n^3+n)/2 for n odd. (End)
a(2*n) = A317297(n+1) + A001489(n). - Stefano Spezia, Dec 28 2018
Sum_{n>0} 1/a(n) = (1/2)*(-2*polygamma(0, 1/2) + polygamma(0, (1-i)/2)+ polygamma(0, (1+i)/2)) + zeta(3)/4 approximately equal to 1.3959168891658447368440622669882813003351669... - Stefano Spezia, Feb 11 2019
a(n) = (A000578(n) + A193356(n))/2. - Stefano Spezia, Jun 27 2022
a(n) = A210378(n-1)/n. - Stefano Spezia, Jul 15 2024

A322277 Permanent of an n X n square matrix M(n) formed by writing the numbers 1, ..., n^2 successively forward and backward along the rows in zig-zag pattern.

Original entry on oeis.org

1, 11, 490, 60916, 15745548, 7477647372, 5799397213200, 6925325038489152, 11958227405868674880, 28853103567727115409600, 93561657023119005869616000, 398720531811315564754326938880, 2174628314166392755825875267321600, 14941853448103858870808931238617312000

Offset: 1

Stefano Spezia, Dec 01 2018

nonn

M(n) is defined as M[i,j,n] = j + n*(i-1) if i is odd and M[i,j,n] = n*i - j + 1 if i is even.
det(M(1)) = 1, det(M(2)) = -5 and det(M(n)) = 0 for n > 2 (proved).
The trace of the matrix M(n) is A317614(n).

			For n = 1 the matrix M(1) is
  1
with permanent a(1) = 1.
For n = 2 the matrix M(2) is
  1, 2
  4, 3
with permanent a(2) = 11.
For n = 3 the matrix M(3) is
  1, 2, 3
  6, 5, 4
  7, 8, 9
with permanent a(3) = 490.

Vaclav Kotesovec, Table of n, a(n) for n = 1..35

Cf. A317614 (trace of matrix M(n)).

Cf. A241016 (row sums of M matrices), A317617 (column sums of M matrices), A074147 (antidiagonals of M matrices).

with(LinearAlgebra):
a := n -> Permanent(Matrix(n, (i, j) -> 1-j+i*n+(-1+2*j-n)*modp(i,2))):
seq(a(n), n = 1 .. 20);

M[i_, j_, n_] := 1 - j + i n + (-1 + 2 j - n) Mod[i, 2]; a[n_] := Permanent[Table[M[i, j, n], {i, n}, {j, n}]]; Array[a, 20]

a(n) = matpermanent(matrix(n, n, i, j, if (i % 2, j + n*(i-1), n*i - j + 1)));
vector(20, n, a(n))

A340804 Triangle read by rows: T(n, k) = 1 + k(n - 1) + (2k - n - 1)*(k mod 2) with 0 < k <= n.

Original entry on oeis.org

1, 1, 3, 1, 5, 9, 1, 7, 11, 13, 1, 9, 13, 17, 25, 1, 11, 15, 21, 29, 31, 1, 13, 17, 25, 33, 37, 49, 1, 15, 19, 29, 37, 43, 55, 57, 1, 17, 21, 33, 41, 49, 61, 65, 81, 1, 19, 23, 37, 45, 55, 67, 73, 89, 91, 1, 21, 25, 41, 49, 61, 73, 81, 97, 101, 121, 1, 23, 27, 45, 53, 67, 79, 89, 105, 111, 131, 133

Offset: 1

Stefano Spezia, Jan 22 2021

T(n, k) is the k-th diagonal element of an n X n square matrix M(n) formed by writing the numbers 1, ..., n^2 successively forward and backward along the rows in zig-zag pattern.

It includes exclusively all the odd numbers (A005408). Except the term 1, all the other odd numbers appear a finite number of times.

			1
1,  3
1,  5,  9,
1,  7, 11, 13
1,  9, 13, 17, 25
1, 11, 15, 21, 29, 31
1, 13, 17, 25, 33, 37, 49
...

Stefano Spezia, Table of n, a(n) for n = 1..11325 (first 150 rows of the triangle, flattened).

Cf. A005408, A317614 (row sums).

Cf. A000012 (1st column), A006010 (sum of the first n rows), A060747 (2nd column), A074147 (antidiagonals of M matrices), A241016 (row sums of M matrices), A317617 (column sums of M matrices), A322277 (permanent of M matrices), A323723 (subdiagonal sum of M matrices), A323724 (superdiagonal sum of M matrices).

Table[1+k(n-1)+(2k-n-1)Mod[k,2],{n,12},{k,n}]//Flatten

T(n, k) = 1 + k*(n - 1) + (2*k - n - 1)*(k % 2); \\ Michel Marcus, Jan 25 2021

O.g.f.: (1 + y - 3*y^2 + y^3 + x*(-1 - y + 5*y^2 + y^3))/((-1 + x)^2*(-1 + y)^2*(1+y)^2).

E.g.f.: exp(x - y)*(1 + x + 2*y + exp(2*y)*(1 + x*(-1 + 2*y)))/2.

A322844 a(n) = (1/12)n^2(3(1 + n^2) - 2(2 + n^2)*(n mod 2)).

Original entry on oeis.org

0, 0, 5, 6, 68, 50, 333, 196, 1040, 540, 2525, 1210, 5220, 2366, 9653, 4200, 16448, 6936, 26325, 10830, 40100, 16170, 58685, 23276, 83088, 32500, 114413, 44226, 153860, 58870, 202725, 76880, 262400, 98736, 334373, 124950, 420228, 156066, 521645, 192660, 640400, 235340

Offset: 0

Stefano Spezia, Dec 28 2018

Conjectures: (Start)
For n > 1, a(n) is the absolute value of the trace of the 2nd exterior power of an n X n square matrix M(n) defined as M[i,j,n] = j + n*(i-1) if i is odd and M[i,j,n] = n*i - j + 1 if i is even (see A317614). Equivalently, a(n) is the absolute value of the coefficient of the term [x^(n-2)] in the characteristic polynomial of the matrix M(n), or the absolute value of the sum of all principal minors of M(n) of size 2.
For k > 2, the trace of the k-th exterior power of the matrix M(n) is equal to zero.
(End)

Stefano Spezia, Table of n, a(n) for n = 0..10000
Wikipedia, Characteristic polynomial
Wikipedia, Exterior algebra
Index entries for linear recurrences with constant coefficients, signature (0,5,0,-10,0,10,0,-5,0,1).

Cf. A317614 (trace of matrix M(n)).

Cf. A002415, A037270, A074147 (antidiagonals of M matrices), A241016 (row sums of M matrices), A317617 (column sums of M matrices), A322277 (permanent of matrix M(n)), A323723 (subdiagonal sum of M matrices), A323724 (superdiagonal sum of M matrices), A325516 (k-superdiagonal sum of M matrices), A325655 (k-subdiagonal sum of M matrices).

Flat(List([0..50], n->(1/12)*n^2*(3*(1 + n^2) - 2*(2 + n^2)*(n mod 2))));

[IsEven(n) select (1/4)*n^2*(1 + n^2) else (1/12)*(- 1 + n)*n^2*(1 + n): n in [0..50]];

a:=n->(1/12)*n^2*(3*(1 + n^2) - 2*(2 + n^2)*modp(n,2)): seq(a(n), n=0..50);

a[n_]:=(1/12)*n^2*(3*(1 + n^2) - 2*(2 + n^2)*Mod[n,2]); Array[a,50,0]
LinearRecurrence[{0,5,0,-10,0,10,0,-5,0,1},{0,0,5,6,68,50,333,196,1040,540},50] (* Harvey P. Dale, Aug 23 2025 *)

a(n):=(1/12)*n^2*(3*(1 + n^2) - 2*(2 + n^2)*mod(n,2))$ makelist(a(n), n, 0, 50);

a(n) = (1/12)*n^2*(3*(1 + n^2) - 2*(2 + n^2)*(n % 2));

a(n) = abs(polcoeff(charpoly(matrix(n, n, i, j, if (i %2, j + n*(i-1), n*i - j + 1))), n-2)); \\ Michel Marcus, Feb 06 2019

[int(n**2*(3*(1 + n**2) - 2*(2 + n**2)*pow(n, 1, 2))/12) for n in range(0,50)]

O.g.f.: -x^2*(5 + 6*x + 43*x^2 + 20*x^3 + 43*x^4 + 6*x^5 + 5*x^6)/((-1 + x)^5*(1 + x)^5).
E.g.f.: (1/(12*x^2))*exp(-x)*(24 - 60*exp(x) + 21*x + 9*x^2 + 2*x^3 + x^4 + exp(2*x)*(36 - 33*x + 15*x^2 - 4*x^3 + 2*x^4)).
a(n) = (1/4)*n^2*(1 + n^2) for n even.
a(n) = (1/2)*A037270(n) for n even.
a(n) = (1/12)*(-1 + n)*n^2*(1 + n) for n odd.
a(n) = A002415(n) for n odd.
a(2*n+1) = 5*a(2*n-1) - 10*a(2*n-3) + 10*a(2*n-5) - 5*a(2*n-7) + a(2*n-9), for n > 4.
a(2*n) = 5*a(2*n-2) - 10*a(2*n-4) + 10*a(2*n-6) - 5*a(2*n-8) + a(2*n-10), for n > 4.
O.g.f. for a(2*n+1): -x*(2*(3 + 10*x + 3*x^2))/(-1 + x)^5.
O.g.f. for a(2*n): x*(-5 - 43*x - 43*x^2 - 5*x^3)/(-1 + x)^5.
E.g.f. for a(2*n+1): (1/12)*(6*x*cosh(sqrt(x)) + sqrt(x)*(6 + x)*sinh(sqrt(x))).
E.g.f. for a(2*n): (1/4)*(x*(8 + x)*cosh(sqrt(x)) + 2*sqrt(x)*(1 + 3*x)*sinh(sqrt(x))).
Sum_{k>=1} 1/a(2*k) = (1/6)*(12 + Pi^2 - 6*Pi*coth(Pi/2)) = 0.21955691692893092525407699347398665248691900...
Sum_{k>=1} 1/a(2*k+1) = 3*(5 - Pi^2/2) = 0.1955933983659620717482635001857732970...
Sum_{k>=2} 1/a(k) = 17 - (4*Pi^2)/3 - Pi*coth(Pi/2) = 0.415150315294892997002340493659759949516369894...

cp's OEIS Frontend

A373878 Row products of A317617.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

A037270 a(n) = n^2*(n^2 + 1)/2.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Python

Formula

A317614 a(n) = (1/2)*(n^3 + n*(n mod 2)).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

GAP

GAP

Magma

Maple

Mathematica

Maxima

PARI

PARI

R

Formula

A322277 Permanent of an n X n square matrix M(n) formed by writing the numbers 1, ..., n^2 successively forward and backward along the rows in zig-zag pattern.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

A340804 Triangle read by rows: T(n, k) = 1 + k*(n - 1) + (2*k - n - 1)*(k mod 2) with 0 < k <= n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A322844 a(n) = (1/12)*n^2*(3*(1 + n^2) - 2*(2 + n^2)*(n mod 2)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

A317614 a(n) = (1/2)(n^3 + n(n mod 2)).

A340804 Triangle read by rows: T(n, k) = 1 + k(n - 1) + (2k - n - 1)*(k mod 2) with 0 < k <= n.

A322844 a(n) = (1/12)n^2(3(1 + n^2) - 2(2 + n^2)*(n mod 2)).