cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 21-30 of 47 results. Next

A135713 a(n) = n*(n+1)*(4*n+1)/2.

Original entry on oeis.org

0, 5, 27, 78, 170, 315, 525, 812, 1188, 1665, 2255, 2970, 3822, 4823, 5985, 7320, 8840, 10557, 12483, 14630, 17010, 19635, 22517, 25668, 29100, 32825, 36855, 41202, 45878, 50895, 56265, 62000, 68112, 74613, 81515, 88830, 96570, 104747, 113373, 122460, 132020
Offset: 0

Views

Author

N. J. A. Sloane, Mar 05 2008

Keywords

Comments

This sequence is related to A045944 by a(n) = n*A045944(n)-Sum_{i=0..n-1} A045944(i); this is the case d=6 in the identity n^2*(d*n+d-2)/2 - sum(k*(d*k+d-2)/2, k=0..n-1) = n*(n+1)*(2*d*n+d-3)/6 . - Bruno Berselli, Nov 19 2010
Bisection (even part) of A002717. See the Conway and Guy reference. - Wolfdieter Lang, Apr 16 2020

References

  • J. H. Conway and R. K. Guy, The Book of Numbers, p. 83.

Crossrefs

Bisection of A002717 (even part).

Programs

  • Magma
    [n*(n+1)*(4*n+1)/2: n in [0..40]];  // Bruno Berselli, Aug 23 2011
  • Mathematica
    LinearRecurrence[{4,-6,4,-1}, {0, 5, 27, 78}, 50] (* Vincenzo Librandi, Mar 01 2012 *)
    Table[n*(n+1)*(4*n+1)/2,{n,0,25}] (* G. C. Greubel, Oct 29 2016 *)
    Table[PolygonalNumber[n](4n+1),{n,0,40}] (* Harvey P. Dale, Apr 26 2025 *)

Formula

O.g.f.: x*(7*x+5)/(x-1)^4. - R. J. Mathar, Apr 22 2008.
a(n) = 4*a(n-1) -6*a(n-2) +4*a(n-3) -a(n-4) for n>3. - Bruno Berselli, Nov 19 2010
a(-n-1) = -A051895(n). - Bruno Berselli, Aug 23 2011
E.g.f.: (1/2)*x*(10 + 17*x + 4*x^2)*exp(x). - G. C. Greubel, Oct 29 2016
Sum_{n>=1} 1/a(n) = 2*(5 - 2*Pi/3 - 4*log(2)) = 0.26603235073404654... - Ilya Gutkovskiy, Oct 29 2016

A202714 T(n,k)=Number of n X n 0..k arrays with row sums equal and no column sum equal to the previous.

Original entry on oeis.org

2, 3, 2, 4, 10, 38, 5, 28, 624, 838, 6, 60, 4740, 173860, 75302, 7, 110, 23036, 7788648, 421158558, 27842760, 8, 182, 83994, 147823100, 189412482924, 8496020082856, 37121438930, 9, 280, 250668, 1631287078
Offset: 1

Views

Author

R. H. Hardin Dec 23 2011

Keywords

Comments

Table starts
...........2.............3............4.........5..........6......7...8.9
...........2............10...........28........60........110....182.280
..........38...........624.........4740.....23036......83994.250668
.........838........173860......7788648.147823100.1631287078
.......75302.....421158558.189412482924
....27842760.8496020082856
.37121438930

Examples

			Some solutions for n=3 k=3
..1..2..2....0..3..3....2..0..3....0..1..2....3..2..2....0..0..3....2..2..1
..3..1..1....3..0..3....3..2..0....0..0..3....3..3..1....0..0..3....1..3..1
..1..1..3....2..3..1....3..0..2....0..3..0....3..2..2....1..2..0....2..3..0
		

Crossrefs

Row 2 is A006331

A350189 Triangle T(n,k) read by rows: the number of symmetric binary n X n matrices with k ones and no all-1 2 X 2 submatrix.

Original entry on oeis.org

1, 1, 1, 1, 2, 2, 2, 1, 3, 6, 10, 9, 9, 4, 1, 4, 12, 28, 46, 72, 80, 80, 60, 16, 1, 5, 20, 60, 140, 296, 500, 780, 1005, 1085, 992, 560, 170, 1, 6, 30, 110, 330, 876, 1956, 4020, 7140, 11480, 16248, 19608, 20560, 16500, 9720, 3276, 360, 1, 7, 42, 182, 665, 2121, 5852, 14792, 33117, 68355, 126994, 214158
Offset: 0

Views

Author

R. J. Mathar, Mar 09 2022

Keywords

Comments

There are 2^(n^2) binary n X n matrices (entries of {0,1}). There are 2^(n*(n+1)/2) symmetric binary matrices. There are A184948(n,k) symmetric binary n X n matrices with k ones.
This sequence is the triangle T(n,k) of symmetric binary n x n matrices with k ones but no 2 X 2 submatrix with all entries = 1. [So in the display of these matrices there is no rectangle with four 1's at the corners.]
The row lengths minus 1 are 0, 1, 3, 6, 9, 12, 17, 21, 24, 29, ... and indicate the maximum number of 1's than can be packed into a symmetric binary n X n matrix without creating an all-1 quadrangle/submatrix of order 2.

Examples

			The triangle starts
  1;
  1 1;
  1 2 2 2;
  1 3 6 10 9 9 4;
  1 4 12 28 46 72 80 80 60 16;
  1 5 20 60 140 296 500 780 1005 1085 992 560 170;
  ...
To place 4 ones, one can place 2 of them in C(n,2) ways on the diagonal and the other 2 in n*(n-1)/2 ways outside the diagonal, avoiding one matrix that builds an all-1 submatrix, which are C(n,2)*(n*(n-1)/2-1) matrices. One can place all 4 on the diagonal in C(n,4) ways. One can place 2 outside the diagonal (the other 2 mirror symmetrically) in C(n*(n-1)/2,2) ways. Sum of the 3 terms is T(n,4) = C(n,3)*(5*n+3)/2. - _R. J. Mathar_, Mar 10 2022
		

Crossrefs

Cf. A001197 (conjectured row lengths), A352258 (row sums), A352801 (rightmost terms), A350296, A350304, A350237, A352472 (traceless symmetric).

Formula

T(n,0) = 1.
T(n,1) = n.
T(n,2) = A002378(n-1).
T(n,3) = A006331(n-1).
T(n,4) = n*(n-1)*(n-2)*(5*n+3)/12 = A147875(n)*A000217(n-1)/3. - R. J. Mathar, Mar 10 2022
T(n,5) = n*(n-1)*(n-2)*(13*n^2-n-24)/60. T(n,6) = n*(n-1)*(n-2)*(19*n^3-18*n^2-97*n+60)/180. T(n,7) = n*(n-1)*(n-2)*(n-3)*(58*n^3+75*n^2-223*n+180)/1260. - Conjectured by R. J. Mathar, Mar 11 2022; proved by Max Alekseyev, Apr 02 2022
G.f.: F(x,y) = Sum_{n,k} T(n,k)*x^n/n!*y^k = exp( Sum_G x^n(G) * y^u(G) / |Aut(G)| ), where G runs over the connected squarefree graphs with loops, n(G) is the number of nodes in G, u(G) the number of ones in the adjacency matrix of G, and Aut(G) is the automorphism group of G. It follows that F(x,y) = exp(x) * (1 + x*y + x^2*y^2 + (2/3*x^3 + x^2)*y^3 + (5/12*x^4 + 3/2*x^3)*y^4 + (13/60*x^5 + 3/2*x^4 + 3/2*x^3)*y^5 + (19/180*x^6 + 7/6*x^5 + 8/3*x^4 + 2/3*x^3)*y^6 + (29/630*x^7 + 3/4*x^6 + 19/6*x^5 + 10/3*x^4)*y^7 + O(y^8)), implying the above formulas for T(n,k). - Max Alekseyev, Apr 02 2022
Conjecture: the largest k such that T(n,k) is nonzero is k = A072567(n) = A001197(n) - 1. - Max Alekseyev, Apr 03 2022

A175929 Triangle T(n,v) read by rows: the number of permutations of [n] with "entropy" equal to 2*v.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 0, 2, 1, 1, 3, 1, 4, 2, 2, 2, 4, 1, 3, 1, 1, 4, 3, 6, 7, 6, 4, 10, 6, 10, 6, 10, 6, 10, 4, 6, 7, 6, 3, 4, 1, 1, 5, 6, 9, 16, 12, 14, 24, 20, 21, 23, 28, 24, 34, 20, 32, 42, 29, 29, 42, 32, 20, 34, 24, 28, 23, 21, 20, 24, 14, 12, 16, 9, 6, 5, 1, 1, 6, 10, 14, 29, 26, 35, 46, 55
Offset: 0

Views

Author

Emeric Deutsch and R. J. Mathar, Oct 22 2010

Keywords

Comments

Define the "entropy" (or variance) of a permutation pi to be Sum_{i=1..n} (pi(i)-i)^2 = A006331(n) - 2*Sum_i i*pi(i), as in A126972.
This characteristic is obviously an even number, 2*v(pi).
Row n of the triangle shows the statistics (frequency distribution) of v for the n! = A000142(n) possible permutations of [n].
T(n,0)=1 arises the identity permutation where v=0.
T(n,1)=n-1 arises from the n-1 different ways of creating an entropy of 2 by swapping a pair of adjacent entries in the identity permutation.
The final 1 in each row arises from the permutation with maximal entropy, that is the permutation with integers reversed relative to the identity permutation.
Row n has 1+A000292(n-1) entries. Row sums are sum_{v=0..A000292(n-1)} T(n,v) = n!.
Removing zeros in A135298 creates a sequence which is similar in the initial terms, because contributions to A135298(n) stem from permutations of some unique [j] if n is not too large, which establishes a 1-to-1 correspondence between the term A006331(n)-2*sum_i i*pi(i) mentioned above and the defining formula in A135298.
The rows of this triangle have a geometric interpretation. Let P_n be the n-dimensional permutohedron, the Voronoi cell of the lattice A_n* (Conway-Sloane, 1993, p. 474), which is a polytope with (n+1)! vertices. Start at any vertex, and count how many vertices there are at squared-distance v from the starting vertex: this is T(n+1,v). For example, in three dimensions the permutohedron is a truncated octahedron, the squared distances from a vertex to all the vertices are (when suitably scaled) 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, and the numbers of vertices at these distances are 1, 3, 1, 4, 2, 2, 2, 4, 1, 3, 1, which is row 4 of the array. See Chap. 21, Section 3.F, op. cit., for further details. - N. J. A. Sloane, Oct 13 2015

Examples

			Triangle T(n,v) starts in row n=0 and column v=0 as follows:
  1;
  1;
  1, 1;
  1, 2, 0, 2, 1;
  1, 3, 1, 4, 2, 2, 2,  4, 1,  3, 1;
  1, 4, 3, 6, 7, 6, 4, 10, 6, 10, 6, 10, 6, 10, 4, 6, 7, 6, 3, 4, 1;
  ...
		

References

  • J. H. Conway and N. J. A. Sloane, "Sphere Packings, Lattices and Groups", Springer-Verlag, 3rd. ed., 1993.

Crossrefs

Row sums give A000142.

Programs

  • Maple
    with(combinat):
    T:= n-> (p-> seq(coeff(p, x, j), j=ldegree(p)..degree(p)))
            (add(x^add(i*l[i], i=1..n), l=permute(n))):
    seq(T(n), n=0..7);  # Alois P. Heinz, Aug 28 2014
    # second Maple program:
    b:= proc(s) option remember; (n-> `if`(n=0, 1, add(expand(
          x^((n-j)^2/2)*b(s minus {j})), j=s)))(nops(s))
        end:
    T:= n-> (p-> seq(coeff(p, x, i), i=0..degree(p)))(b({$1..n})):
    seq(T(n), n=0..7);  # Alois P. Heinz, Mar 02 2024
  • Mathematica
    b[s_] := b[s] = With[{n = Length[s]}, If[n == 0, 1, Sum[Expand[x^((n-j)^2/2)*b[s~Complement~{j}]], {j, s}]]];
    T[n_] := CoefficientList[b[Range[n]], x];
    Table[T[n], {n, 0, 7}] // Flatten (* Jean-François Alcover, Mar 22 2024, after Alois P. Heinz *)

Formula

Sum_{k>=0} k * T(n,k) = A001754(n+1). - Alois P. Heinz, Mar 02 2024

Extensions

Row length term corrected by R. J. Mathar, Oct 23 2010
T(0,0)=1 prepended by Alois P. Heinz, Nov 23 2023

A185878 Accumulation array of A185877, by antidiagonals.

Original entry on oeis.org

1, 4, 2, 11, 10, 3, 24, 28, 18, 4, 45, 60, 51, 28, 5, 76, 110, 108, 80, 40, 6, 119, 182, 195, 168, 115, 54, 7, 176, 280, 318, 300, 240, 156, 70, 8, 249, 408, 483, 484, 425, 324, 203, 88, 9, 340, 570, 696, 728, 680, 570, 420, 256, 108, 10, 451, 770, 963, 1040, 1015, 906, 735, 528, 315, 130, 11, 584, 1012, 1290, 1428, 1440, 1344, 1162, 920, 648, 380, 154, 12
Offset: 1

Views

Author

Clark Kimberling, Feb 05 2011

Keywords

Comments

A member of the accumulation chain ... < A185879 < A185877 < A185878 < A185880 < ...
See A144112 for the definition of accumulation array.

Examples

			Northwest corner:
  1,  4, 11,  24,  45, ...
  2, 10, 28,  60, 110, ...
  3, 18, 51, 108, 195, ...
  4, 28, 80, 168, 300, ...
  ...
		

Crossrefs

Row 1 to 3: A006527, A006331, A064043.
Column 1 to 5: A000027, A028552, A140677, 12*A000096, 5*A130861.

Programs

  • Mathematica
    f[n_, k_] := k*n*(2*k^2 - 3*k + 3*k*n - 3*n + 7)/6; Table[f[n - k + 1, k], {n,10}, {k, n, 1, -1}] // Flatten (* G. C. Greubel, Jul 21 2017 *)

Formula

T(n,k) = k*n*(2*k^2 -3*k +3*k*n -3*n +7)/6, k>=1, n>=1.

A188475 a(n) = (2*n^3 + 3*n^2 + n + 3)/3.

Original entry on oeis.org

1, 3, 11, 29, 61, 111, 183, 281, 409, 571, 771, 1013, 1301, 1639, 2031, 2481, 2993, 3571, 4219, 4941, 5741, 6623, 7591, 8649, 9801, 11051, 12403, 13861, 15429, 17111, 18911, 20833, 22881, 25059, 27371, 29821, 32413, 35151, 38039, 41081, 44281, 47643
Offset: 0

Views

Author

Paul Barry, Apr 01 2011

Keywords

Comments

Hankel transform of A137398(n+1) (conjecture).

Programs

Formula

G.f.: (1 - x + 5*x^2 - x^3)/(1-x)^4.
a(n) = A006331(n) + 1. - Bruno Berselli, Nov 14 2011

A193218 Number of vertices in truncated tetrahedron with faces that are centered polygons.

Original entry on oeis.org

1, 21, 95, 259, 549, 1001, 1651, 2535, 3689, 5149, 6951, 9131, 11725, 14769, 18299, 22351, 26961, 32165, 37999, 44499, 51701, 59641, 68355, 77879, 88249, 99501, 111671, 124795, 138909, 154049, 170251, 187551, 205985, 225589, 246399, 268451, 291781, 316425
Offset: 1

Views

Author

Craig Ferguson, Jul 18 2011

Keywords

Comments

The sequence starts with a central vertex and expands outward with (n-1) centered polygonal pyramids producing a truncated tetrahedron. Each iteration requires the addition of (n-2) edges and (n-1) vertices to complete the centered polygon in each face. For centered triangles see A005448 and centered hexagons A003215.
This sequence is the 18th in the series (1/12)*t*(2*n^3-3*n^2+n)+2*n-1 for t = 2, 4, 6, ... gives A049480, A005894, A063488, A001845, A063489, A005898, A063490, A057813, A063491, A005902, A063492, A005917, A063493, A063494, A063495, A063496 and t = 36. While adjusting for offsets, the beginning sequence A049480 is generated by adding the square pyramidal numbers A000330 to the odd numbers A005408 and each subsequent sequence is found by adding another set of square pyramidals A000330. (T/2) * A000330(n) + A005408(n). At 30 * A000330 + A005408 = centered dodecahedral numbers, 36 * A000330 + A005408 = A193228 truncated octahedron and 90 * A000330 + A005408 = A193248 = truncated icosahedron and dodecahedron. All five of the "Centered Platonic Solids" numbers sequences are in this series of sequences. Also 4 out of five of the "truncated" platonic solid number sequences are in this series. - Bruce J. Nicholson, Jul 06 2018
It would be good to have a detailed description of how the sequence is constructed. Maybe in the Examples section? - N. J. A. Sloane, Sep 07 2018

Crossrefs

Cf. A260810 (partial sums).

Programs

  • Magma
    [6*n^3-9*n^2+5*n-1: n in [1..40]]; // Vincenzo Librandi, Aug 30 2011
  • Mathematica
    Table[6 n^3 - 9 n^2 + 5 n - 1, {n, 35}] (* Alonso del Arte, Jul 18 2011 *)
    CoefficientList[Series[(1+x)*(x^2+16*x+1)/(1-x)^4, {x, 0, 50}], x] (* Stefano Spezia, Sep 04 2018 *)

Formula

a(n) = 6*n^3 - 9*n^2 + 5*n - 1.
G.f.: x*(1+x)*(x^2+16*x+1) / (1-x)^4. - R. J. Mathar, Aug 26 2011
a(n) = 18 * A000330(n-1) + A005408(n-1) = A063496(n) + A006331(n-1). - Bruce J. Nicholson, Jul 06 2018

A322549 Square array A(n,k), n>=0, k>=0, read by antidiagonals, where A(n,k) is the constant term in the expansion of (Sum_{j=0..n} j*(x^j + x^(-j)))^k.

Original entry on oeis.org

1, 0, 1, 0, 0, 1, 0, 2, 0, 1, 0, 0, 10, 0, 1, 0, 6, 12, 28, 0, 1, 0, 0, 198, 84, 60, 0, 1, 0, 20, 560, 2076, 324, 110, 0, 1, 0, 0, 5020, 14240, 12060, 924, 182, 0, 1, 0, 70, 20580, 213460, 146680, 49170, 2184, 280, 0, 1, 0, 0, 144774, 1984584, 3479700, 922680, 158418, 4536, 408, 0, 1
Offset: 0

Views

Author

Seiichi Manyama, Dec 15 2018

Keywords

Examples

			Square array begins:
   1, 0,   0,    0,      0,       0,         0, ...
   1, 0,   2,    0,      6,       0,        20, ...
   1, 0,  10,   12,    198,     560,      5020, ...
   1, 0,  28,   84,   2076,   14240,    213460, ...
   1, 0,  60,  324,  12060,  146680,   3479700, ...
   1, 0, 110,  924,  49170,  922680,  32108060, ...
   1, 0, 182, 2184, 158418, 4226040, 203474180, ...
		

Crossrefs

Main diagonal gives A318793.
Cf. A201552.

Programs

  • Mathematica
    A[0, 0] = 1; A[n_, k_] :=  Coefficient[Expand[Sum[j * (x^j + x^(-j)), {j, 0, n}]^k], x, 0]; Table[A[n-k, k], {n, 0, 10}, {k, n, 0, -1}] // Flatten (* Amiram Eldar, Dec 16 2018 *)
  • PARI
    T(n,k) = my(t=sum(j=0, n, j*(x^j + x^(-j)))^k); polcoef(numerator(t), poldegree(denominator(t))); \\ Michel Marcus, Dec 17 2018

A323939 Number of unbranched tri-4-catafusenes under the symmetry point group C_{2v} as a function of the number of hexagons (see Cyvin et al. (1996) for precise definition).

Original entry on oeis.org

0, 2, 5, 10, 22, 28, 65, 60, 172, 110, 461, 182, 1314, 280, 3977, 408, 12504, 570, 40021, 770, 128814, 1012, 414481, 1300, 1330052, 1638, 4253341, 2030, 13553978, 2480, 43049433, 2992, 136317872, 3570, 430471077, 4218, 1355976262, 4940, 4261630689, 5740, 13366013020, 6622
Offset: 3

Views

Author

N. J. A. Sloane, Feb 09 2019

Keywords

Comments

From Petros Hadjicostas, May 25 2019: (Start)
According to the Schoenflies notation used in Chemistry, the point group C_{2v} is the cyclic group C_2 "with the addition of" 2 "mirror planes containing the axis of rotation (vertical planes)" (see the Wikipedia article about the Schoenflies notation).
According to the Wikipedia article about Molecular symmetry, a simple description of typical geometry of this group is "angular (H2O) or see-saw (SF4)" (where SF4 = sulfur tetrafluoride).
According to Cyvin et al. (1996, p. 496), a catafusene is a "simply connected catacondensed polyhex". "It is a system consisting of congruent regular hexagons, where any two hexagons either share exactly one edge or are disjointed". "A tri-4-catafusene is generated by contraction of exactly three of its hexagons to tetragons" (see p. 499).
In general (see p. 496), "any alpha-q-catafusene (q = 3-5) can be generated from a catafusene on converting alpha of its hexagons to q-gons by contraction". Here, obviously, alpha = 3 and q = 4.
Here, a(n) is the number of (non-equivalent) unbranched tri-4-catafusenes under the symmetry point group C_{2v}, where n = number of polygons (also known as "rings") in the unbranched tri-4-catafusenes. (Hence, n - 3 is the total number of the remaining hexagons since 3 of the original hexagons became tetragons.) In the paper, the letter r is used to denote the number of polygons rather than the letter n (see p. 496).
The numbers (a(n): n >= 3) = (a(r): r >= 3) appear in Table 1 on p. 500 of Cyvin et al. (1996) under the point group C_{2v}.
In the paper, a(n) is denoted by M_r (p. 500) and is called the total number of "mirror-symmetrical (C_{2v}) systems" (here r = n). It is decomposed into the sum C_r + L_r, where C_r is the number of "centrosymmetrical (C_{2h}) systems" (p. 499) and L_r = (1/2)*binomial(r, 3) - (1/8)*(1-(-1)^r)*(r-1) (see Eq. (15) on p. 499). The numbers L_r count some kind of symmetry described on p. 499 of the paper, but it is unclear what they exactly count.
The point group C_{2h} mentioned above (with the centrosymmetrical systems) is the cyclic group C_2 "with the addition of a mirror (reflection) plane perpendicular to the axis of rotation (horizontal plane)" (see the Wikipedia articles about Molecular symmetry and the Schoenflies notation).
Unfortunately, the letter C is used for two different purposes in the paper: to denote various point groups in three dimensions and to denote the number of non-equivalent systems of contracted catafusenes under some kind of symmetry.
The numbers (C_r: r >= 0), which apparently appear in Table 1 (p. 500) under the point group C_{2h} (see above), satisfy C_{2*i} = 0 and C_{2*i+3} = (1/2)*Sum_{1 <= j <= i} j*a_{i+1,j} (see Eq. (17), p. 500), where the double array a_{i,j} appears on p. 498 (Section 5) of the paper. We have a_{i,j} = binomial(i-1, j-1)*2^(i-j) = A038207(i-1, j-1) for i, j >= 1 (see Eq. (32), p. 502 in the paper).
Putting the above information together, we can easily prove the formulas for a(n) that appear below in the FORMULA section.
Note that the notation for the current sequence a(n) should not be confused with the double array a_{i,j} defined on p. 498 of the paper.
(End)

Crossrefs

Programs

  • Mathematica
    a[n_] := (1/24) (3((-1)^n - 1) (n - 1) + 2 n (n - 1) (n - 2)+ ((-1)^(n + 1) + 1) (-3n + 3^((n - 3)/2) (n + 3) + 3));
    a /@ Range[3, 44] (* Jean-François Alcover, Oct 24 2019 *)
  • PARI
    concat(0, Vec(x^4*(2 + x - 14*x^2 - x^3 + 22*x^4 - 3*x^5 + 2*x^6 - x^7) / ((1 - x)^4*(1 + x)^2*(1 - 3*x^2)^2) + O(x^40))) \\ Colin Barker, May 30 2019

Formula

From Petros Hadjicostas, May 26 2019: (Start)
a(n) = L(n) + C(n) for n >= 3, where L(n) = (1/2)*binomial(n, 3) - (1/8)*(1-(-1)^n)*(n-1) and C(n) = (1/24)*(1 - (-1)^n)*((n + 3)*3^((n-3)/2) - 3*(n-1)).
a(2*m) = binomial(2*m, 3)/2 = A006331(m - 1) for m >= 2, and a(2*m + 1) = binomial(2*m + 1, 3)/2 + (m + 2)*3^m/18 - m for m >= 1.
(End)
From Colin Barker, May 28 2019: (Start)
G.f.: x^4*(2 + x - 14*x^2 - x^3 + 22*x^4 - 3*x^5 + 2*x^6 - x^7) / ((1 - x)^4*(1 + x)^2*(1 - 3*x^2)^2).
a(n) = 2*a(n-1) + 7*a(n-2) - 16*a(n-3) - 14*a(n-4) + 44*a(n-5) + 2*a(n-6) - 48*a(n-7) + 15*a(n-8) + 18*a(n-9) - 9*a(n-10) for n>12.
(End)

Extensions

Name edited by Petros Hadjicostas, May 26 2019
More terms from Petros Hadjicostas, May 26 2019

A331889 Table T(n,k) read by upward antidiagonals. T(n,k) is the minimum value of Sum_{i=1..n} Product_{j=1..k} r[(i-1)*k+j] among all permutations r of {1..kn}.

Original entry on oeis.org

1, 3, 2, 6, 10, 6, 10, 28, 54, 24, 15, 60, 214, 402, 120, 21, 110, 594, 2348, 3810, 720, 28, 182, 1334, 8556, 32808, 43776, 5040, 36, 280, 2614
Offset: 1

Views

Author

Chai Wah Wu, Mar 20 2020

Keywords

Comments

k 1 2 3 4 5 6 7 8 9 10 11 12
---------------------------------------------------------------------------------
n 1| 1 2 6 24 120 720 5040 40320 362880 3628800 39916800 479001600
2| 3 10 54 402 3810 43776
3| 6 28 214 2348 32808
4| 10 60 594 8556
5| 15 110 1334
6| 21 182 2614
7| 28 280
8| 36 408
9| 45 570
10| 55 770

Crossrefs

Programs

  • Python
    from itertools import combinations, permutations
    from sympy import factorial
    def T(n,k): # T(n,k) for A331889
        if k == 1:
            return n*(n+1)//2
        if n == 1:
            return int(factorial(k))
        if k == 2:
            return n*(n+1)*(2*n+1)//3
        nk = n*k
        nktuple = tuple(range(1,nk+1))
        nkset = set(nktuple)
        count = int(factorial(nk))
        for firsttuple in combinations(nktuple,n):
            nexttupleset = nkset-set(firsttuple)
            for s in permutations(sorted(nexttupleset),nk-2*n):
                llist = sorted(nexttupleset-set(s),reverse=True)
                t = list(firsttuple)
                for i in range(0,k-2):
                    itn = i*n
                    for j in range(n):
                            t[j] *= s[itn+j]
                t.sort()
                v = 0
                for i in range(n):
                    v += llist[i]*t[i]
                if v < count:
                    count = v
        return count

Formula

T(n,k) >= ceiling(n*((kn)!)^(1/n)).
T(n,1) = n*(n+1)/2 = A000217(n).
T(1,k) = k! = A000142(k).
T(n,3) = A072368(n).
T(n,2) = n*(n+1)*(2*n+1)/3 = A006331(n).
Previous Showing 21-30 of 47 results. Next