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.

Showing 1-9 of 9 results.

A092187 A092186(n)/2.

Original entry on oeis.org

1, 1, 4, 6, 36, 72, 576, 1440, 14400, 43200, 518400, 1814400, 25401600, 101606400, 1625702400, 7315660800, 131681894400, 658409472000, 13168189440000, 72425041920000, 1593350922240000, 9560105533440000, 229442532802560000, 1491376463216640000, 38775788043632640000
Offset: 2

Views

Author

N. J. A. Sloane, Apr 02 2004

Keywords

A002620 Quarter-squares: a(n) = floor(n/2)*ceiling(n/2). Equivalently, a(n) = floor(n^2/4).

Original entry on oeis.org

0, 0, 1, 2, 4, 6, 9, 12, 16, 20, 25, 30, 36, 42, 49, 56, 64, 72, 81, 90, 100, 110, 121, 132, 144, 156, 169, 182, 196, 210, 225, 240, 256, 272, 289, 306, 324, 342, 361, 380, 400, 420, 441, 462, 484, 506, 529, 552, 576, 600, 625, 650, 676, 702, 729, 756, 784, 812
Offset: 0

Views

Author

N. J. A. Sloane

Keywords

Comments

b(n) = a(n+2) is the number of multigraphs with loops on 2 nodes with n edges [so g.f. for b(n) is 1/((1-x)^2*(1-x^2))]. Also number of 2-covers of an n-set; also number of 2 X n binary matrices with no zero columns up to row and column permutation. - Vladeta Jovovic, Jun 08 2000
a(n) is also the maximal number of edges that a triangle-free graph of n vertices can have. For n = 2m, the maximum is achieved by the bipartite graph K(m, m); for n = 2m + 1, the maximum is achieved by the bipartite graph K(m, m + 1). - Avi Peretz (njk(AT)netvision.net.il), Mar 18 2001
a(n) is the number of arithmetic progressions of 3 terms and any mean which can be extracted from the set of the first n natural numbers (starting from 1). - Santi Spadaro, Jul 13 2001
This is also the order dimension of the (strong) Bruhat order on the Coxeter group A_{n-1} (the symmetric group S_n). - Nathan Reading (reading(AT)math.umn.edu), Mar 07 2002
Let M_n denote the n X n matrix m(i,j) = 2 if i = j; m(i, j) = 1 if (i+j) is even; m(i, j) = 0 if i + j is odd, then a(n+2) = det M_n. - Benoit Cloitre, Jun 19 2002
Sums of pairs of neighboring terms are triangular numbers in increasing order. - Amarnath Murthy, Aug 19 2002
Also, from the starting position in standard chess, minimum number of captures by pawns of the same color to place n of them on the same file (column). Beyond a(6), the board and number of pieces available for capture are assumed to be extended enough to accomplish this task. - Rick L. Shepherd, Sep 17 2002
For example, a(2) = 1 and one capture can produce "doubled pawns", a(3) = 2 and two captures is sufficient to produce tripled pawns, etc. (Of course other, uncounted, non-capturing pawn moves are also necessary from the starting position in order to put three or more pawns on a given file.) - Rick L. Shepherd, Sep 17 2002
Terms are the geometric mean and arithmetic mean of their neighbors alternately. - Amarnath Murthy, Oct 17 2002
Maximum product of two integers whose sum is n. - Matthew Vandermast, Mar 04 2003
a(n+2) gives number of non-symmetric partitions of n into at most 3 parts, with zeros used as padding. E.g., a(7) = 12 because we can write 5 = 5 + 0 + 0 = 0 + 5 + 0 = 4 + 1 + 0 = 1 + 4 + 0 = 1 + 0 + 4 = 3 + 2 + 0 = 2 + 3 + 0 = 2 + 0 + 3 = 2 + 2 + 1 = 2 + 1 + 2 = 3 + 1 + 1 = 1 + 3 + 1. - Jon Perry, Jul 08 2003
a(n-1) gives number of distinct elements greater than 1 of non-symmetric partitions of n into at most 3 parts, with zeros used as padding, appear in the middle. E.g., 5 = 5 + 0 + 0 = 0 + 5 + 0 = 4 + 1 + 0 = 1 + 4 + 0 = 1 + 0 + 4 = 3 + 2 + 0 = 2 + 3 + 0 = 2 + 0 + 3 = 2 + 2 + 1 = 2 + 1 + 2 = 3 + 1 + 1 = 1 + 3 + 1. Of these, 050, 140, 320, 230, 221, 131 qualify and a(4) = 6. - Jon Perry, Jul 08 2003
Union of square numbers (A000290) and oblong numbers (A002378). - Lekraj Beedassy, Oct 02 2003
Conjectured size of the smallest critical set in a Latin square of order n (true for n <= 8). - Richard Bean, Jun 12 2003 and Nov 18 2003
a(n) gives number of maximal strokes on complete graph K_n, when edges on K_n can be assigned directions in any way. A "stroke" is a locally maximal directed path on a directed graph. Examples: n = 3, two strokes can exist, "x -> y -> z" and " x -> z", so a(3) = 2. n = 4, four maximal strokes exist, "u -> x -> z" and "u -> y" and "u -> z" and "x -> y -> z", so a(4) = 4. - Yasutoshi Kohmoto, Dec 20 2003
Number of symmetric Dyck paths of semilength n+1 and having three peaks. E.g., a(4) = 4 because we have U*DUUU*DDDU*D, UU*DUU*DDU*DD, UU*DDU*DUU*DD and UUU*DU*DU*DDD, where U = (1, 1), D = (1, -1) and * indicates a peak. - Emeric Deutsch, Jan 12 2004
Number of valid inequalities of the form j + k < n + 1, where j and k are positive integers, j <= k, n >= 0. - Rick L. Shepherd, Feb 27 2004
See A092186 for another application.
Also, the number of nonisomorphic transversal combinatorial geometries of rank 2. - Alexandr S. Radionov (rasmailru(AT)mail.ru), Jun 02 2004
a(n+1) is the transform of n under the Riordan array (1/(1-x^2), x). - Paul Barry, Apr 16 2005
1, 2, 4, 6, 9, 12, 16, 20, 25, 30, ... specifies the largest number of copies of any of the gifts you receive on the n-th day in the "Twelve Days of Christmas" song. For example, on the fifth day of Christmas, you have 9 French hens. - Alonso del Arte, Jun 17 2005
a(n+1) is the number of noncongruent integer-sided triangles with largest side n. - David W. Wilson [Comment corrected Sep 26 2006]
A quarter-square table can be used to multiply integers since n*m = a(n+m) - a(n-m) for all integer n, m. - Michael Somos, Oct 29 2006
The sequence is the size of the smallest strong critical set in a Latin square of order n. - G.H.J. van Rees (vanrees(AT)cs.umanitoba.ca), Feb 16 2007
Maximal number of squares (maximal area) in a polyomino with perimeter 2n. - Tanya Khovanova, Jul 04 2007
For n >= 3 a(n-1) is the number of bracelets with n+3 beads, 2 of which are red, 1 of which is blue. - Washington Bomfim, Jul 26 2008
Equals row sums of triangle A122196. - Gary W. Adamson, Nov 29 2008
Also a(n) is the number of different patterns of a 2-colored 3-partition of n. - Ctibor O. Zizka, Nov 19 2014
Also a(n-1) = C(((n+(n mod 2))/2), 2) + C(((n-(n mod 2))/2), 2), so this is the second diagonal of A061857 and A061866, and each even-indexed term is the average of its two neighbors. - Antti Karttunen
Equals triangle A171608 * ( 1, 2, 3, ...). - Gary W. Adamson, Dec 12 2009
a(n) gives the number of nonisomorphic faithful representations of the Symmetric group S_3 of dimension n. Any faithful representation of S_3 must contain at least one copy of the 2-dimensional irrep, along with any combination of the two 1-dimensional irreps. - Andrew Rupinski, Jan 20 2011
a(n+2) gives the number of ways to make change for "c" cents, letting n = floor(c/5) to account for the 5-repetitive nature of the task, using only pennies, nickels and dimes (see A187243). - Adam Sasson, Mar 07 2011
a(n) belongs to the sequence if and only if a(n) = floor(sqrt(a(n))) * ceiling(sqrt(a(n))), that is, a(n) = k^2 or a(n) = k*(k+1), k >= 0. - Daniel Forgues, Apr 17 2011
a(n) is the sum of the positive integers < n that have the opposite parity as n.
Deleting the first 0 from the sequence results in a sequence b = 0, 1, 2, 4, ... such that b(n) is sum of the positive integers <= n that have the same parity as n. The sequence b(n) is the additive counterpart of the double factorial. - Peter Luschny, Jul 06 2011
Third outer diagonal of Losanitsch's Triangle, A034851. - Fred Daniel Kline, Sep 10 2011
Written as a(1) = 1, a(n) = a(n-1) + ceiling (a(n-1)) this is to ceiling as A002984 is to floor, and as A033638 is to round. - Jonathan Vos Post, Oct 08 2011
a(n-2) gives the number of distinct graphs with n vertices and n regions. - Erik Hasse, Oct 18 2011
Construct the n-th row of Pascal's triangle (A007318) from the preceding row, starting with row 0 = 1. a(n) counts the total number of additions required to compute the triangle in this way up to row n, with the restrictions that copying a term does not count as an addition, and that all additions not required by the symmetry of Pascal's triangle are replaced by copying terms. - Douglas Latimer, Mar 05 2012
a(n) is the sum of the positive differences of the parts in the partitions of n+1 into exactly 2 parts. - Wesley Ivan Hurt, Jan 27 2013
a(n) is the maximum number of covering relations possible in an n-element graded poset. For n = 2m, this bound is achieved for the poset with two sets of m elements, with each point in the "upper" set covering each point in the "lower" set. For n = 2m+1, this bound is achieved by the poset with m nodes in an upper set covering each of m+1 nodes in a lower set. - Ben Branman, Mar 26 2013
a(n+2) is the number of (integer) partitions of n into 2 sorts of 1's and 1 sort of 2's. - Joerg Arndt, May 17 2013
Alternative statement of Oppermann's conjecture: For n>2, there is at least one prime between a(n) and a(n+1). - Ivan N. Ianakiev, May 23 2013. [This conjecture was mentioned in A220492, A222030. - Omar E. Pol, Oct 25 2013]
For any given prime number, p, there are an infinite number of a(n) divisible by p, with those a(n) occurring in evenly spaced clusters of three as a(n), a(n+1), a(n+2) for a given p. The divisibility of all a(n) by p and the result are given by the following equations, where m >= 1 is the cluster number for that p: a(2m*p)/p = p*m^2 - m; a(2m*p + 1)/p = p*m^2; a(2m*p + 2)/p = p*m^2 + m. The number of a(n) instances between clusters is 2*p - 3. - Richard R. Forberg, Jun 09 2013
Apart from the initial term this is the elliptic troublemaker sequence R_n(1,2) in the notation of Stange (see Table 1, p.16). For other elliptic troublemaker sequences R_n(a,b) see the cross references below. - Peter Bala, Aug 08 2013
a(n) is also the total number of twin hearts patterns (6c4c) packing into (n+1) X (n+1) coins, the coins left is A042948 and the voids left is A000982. See illustration in links. - Kival Ngaokrajang, Oct 24 2013
Partitions of 2n into parts of size 1, 2 or 4 where the largest part is 4, i.e., A073463(n,2). - Henry Bottomley, Oct 28 2013
a(n+1) is the minimum length of a sequence (of not necessarily distinct terms) that guarantees the existence of a (not necessarily consecutive) subsequence of length n in which like terms appear consecutively. This is also the minimum cardinality of an ordered set S that ensures that, given any partition of S, there will be a subset T of S so that the induced subpartition on T avoids the pattern ac/b, where a < b < c. - Eric Gottlieb, Mar 05 2014
Also the number of elements of the list 1..n+1 such that for any two elements {x,y} the integer (x+y)/2 lies in the range ]x,y[. - Robert G. Wilson v, May 22 2014
Number of lattice points (x,y) inside the region of the coordinate plane bounded by x <= n, 0 < y <= x/2. For a(11)=30 there are exactly 30 lattice points in the region below:
6| .
.| . |
5| .+__+
.| . | | |
4| .+__++__+
.| . | | | | |
3| .+__++__++__+
.| . | | | | | | |
2| .+__++__++__++__+
.| . | | | | | | | | |
1| .+__++__++__++__++__+
.|. | | | | | | | | | | |
0|.+__++__++__++__++__++_________
0 1 2 3 4 5 6 7 8 9 10 11 .. n
0 0 1 2 4 6 9 12 16 20 25 30 .. a(n) - Wesley Ivan Hurt, Oct 26 2014
a(n+1) is the greatest integer k for which there exists an n x n matrix M of nonnegative integers with every row and column summing to k, such that there do not exist n entries of M, all greater than 1, and no two of these entries in the same row or column. - Richard Stanley, Nov 19 2014
In a tiling of the triangular shape T_N with row length k for row k = 1, 2, ..., N >= 1 (or, alternatively row length N = 1-k for row k) with rectangular tiles, there can appear rectangles (i, j), N >= i >= j >= 1, of a(N+1) types (and their transposed shapes obtained by interchanging i and j). See the Feb 27 2004 comment above from Rick L. Shepherd. The motivation to look into this came from a proposal of Kival Ngaokrajang in A247139. - Wolfdieter Lang, Dec 09 2014
Every positive integer is a sum of at most four distinct quarter-squares; see A257018. - Clark Kimberling, Apr 15 2015
a(n+1) gives the maximal number of distinct elements of an n X n matrix which is symmetric (w.r.t. the main diagonal) and symmetric w.r.t. the main antidiagonal. Such matrices are called bisymmetric. See the Wikipedia link. - Wolfdieter Lang, Jul 07 2015
For 2^a(n+1), n >= 1, the number of binary bisymmetric n X n matrices, see A060656(n+1) and the comment and link by Dennis P. Walsh. - Wolfdieter Lang, Aug 16 2015
a(n) is the number of partitions of 2n+1 of length three with exactly two even entries (see below example). - John M. Campbell, Jan 29 2016
a(n) is the sum of the asymmetry degrees of all 01-avoiding binary words of length n. The asymmetry degree of a finite sequence of numbers is defined to be the number of pairs of symmetrically positioned distinct entries. a(6) = 9 because the 01-avoiding binary words of length 6 are 000000, 100000, 110000, 111000, 111100, 111110, and 111111, and the sum of their asymmetry degrees is 0 + 1 + 2 + 3 + 2 + 1 + 0 = 9. Equivalently, a(n) = Sum_{k>=0} k*A275437(n,k). - Emeric Deutsch, Aug 15 2016
a(n) is the number of ways to represent all the integers in the interval [3,n+1] as the sum of two distinct natural numbers. E.g., a(7)=12 as there are 12 different ways to represent all the numbers in the interval [3,8] as the sum of two distinct parts: 1+2=3, 1+3=4, 1+4=5, 1+5=6, 1+6=7, 1+7=8, 2+3=5, 2+4=6, 2+5=7, 2+6=8, 3+4=7, 3+5=8. - Anton Zakharov, Aug 24 2016
a(n+2) is the number of conjugacy classes of involutions (considering the identity as an involution) in the hyperoctahedral group C_2 wreath S_n. - Mark Wildon, Apr 22 2017
a(n+2) is the maximum number of pieces of a pizza that can be made with n cuts that are parallel or perpendicular to each other. - Anton Zakharov, May 11 2017
Also the matching number of the n X n black bishop graph. - Eric W. Weisstein, Jun 26 2017
The answer to a question posed by W. Mantel: a(n) is the maximum number of edges in an n-vertex triangle-free graph. Also solved by H. Gouwentak, J. Teixeira de Mattes, F. Schuh and W. A. Wythoff. - Charles R Greathouse IV, Feb 01 2018
Number of nonisomorphic outer planar graphs of order n >= 3, size n+2, and maximum degree 4. - Christian Barrientos and Sarah Minion, Feb 27 2018
Maximum area of a rectangle with perimeter 2n and sides of integer length. - André Engels, Jul 29 2018
Also the crossing number of the complete bipartite graph K_{3,n+1}. - Eric W. Weisstein, Sep 11 2018
a(n+2) is the number of distinct genotype frequency vectors possible for a sample of n diploid individuals at a biallelic genetic locus with a specified major allele. Such vectors are the lists of nonnegative genotype frequencies (n_AA, n_AB, n_BB) with n_AA + n_AB + n_BB = n and n_AA >= n_BB. - Noah A Rosenberg, Feb 05 2019
a(n+2) is the number of distinct real spectra (eigenvalues repeated according to their multiplicity) for an orthogonal n X n matrix. The case of an empty spectrum list is logically counted as one of those possibilities, when it exists. Thus a(n+2) is the number of distinct reduced forms (on the real field, in orthonormal basis) for elements in O(n). - Christian Devanz, Feb 13 2019
a(n) is the number of non-isomorphic asymmetric graphs that can be created by adding a single edge to a path on n+4 vertices. - Emma Farnsworth, Natalie Gomez, Herlandt Lino, and Darren Narayan, Jul 03 2019
a(n+1) is the number of integer triangles with largest side n. - James East, Oct 30 2019
a(n) is the number of nonempty subsets of {1,2,...,n} that contain exactly one odd and one even number. For example, for n=7, a(7)=12 and the 12 subsets are {1,2}, {1,4}, {1,6}, {2,3}, {2,5}, {2,7}, {3,4}, {3,6}, {4,5}, {4,7}, {5,6}, {6,7}. - Enrique Navarrete, Dec 16 2019
a(n+1) is also the n-th term of the Saind sequence (w_n){n>=1}, i.e., the infinite sequence caused by the entries of the queue of the degree sequences associated with the Saind arrays, as n increases. - _Giulia Palma, Jun 24 2020
Aside from the first two terms, a(n) enumerates the number of distinct normal ordered terms in the expansion of the differential operator (x + d/dx)^m associated to the Hermite polynomials and the Heisenberg-Weyl algebra. It also enumerates the number of distinct monomials in the bivariate polynomials corresponding to the partial sums of the series for cos(x+y) and sin(x+y). Cf. A344678. - Tom Copeland, May 27 2021
a(n) is the maximal number of negative products a_i * a_j (1 <= i <= j <= n), where all a_i are real numbers. - Logan Pipes, Jul 08 2021
From Allan Bickle, Dec 20 2021: (Start)
a(n) is the maximum product of the chromatic numbers of a graph of order n-1 and its complement. The extremal graphs are characterized in the papers of Finck (1968) and Bickle (2023).
a(n) is the maximum product of the degeneracies of a graph of order n+1 and its complement. The extremal graphs are characterized in the paper of Bickle (2012). (End)
a(n) is the maximum number m such that m white rooks and m black rooks can coexist on an n-1 X n-1 chessboard without attacking each other. - Aaron Khan, Jul 13 2022
Partial sums of A004526. - Bernard Schott, Jan 06 2023
a(n) is the number of 231-avoiding odd Grassmannian permutations of size n. - Juan B. Gil, Mar 10 2023
a(n) is the number of integer tuples (x,y) satisfying n + x + y >= 0, 25*n + x - 11*y >=0, 25*n - 11*x + y >=0, n + x + y == 0 (mod 12) , 25*n + x - 11*y == 0 (mod 5), 25*n - 11*x + y == 0 (mod 5) . For n=2, the sole solution is (x,y) = (0,0) and so a(2) = 1. For n = 3, the a(3) = 2 solutions are (-3, 2) and (2, -3). - Jeffery Opoku, Feb 16 2024
Let us consider triangles whose vertices are the centers of three squares constructed on the sides of a right triangle. a(n) is the integer part of the area of these triangles, taken without repetitions and in ascending order. See the illustration in the links. - Nicolay Avilov, Aug 05 2024
For n>=2, a(n) is the indendence number of the 2-token graph F_2(P_n) of the path graph P_n on n vertices. (Alternatively, as noted by Peter Munn, F_2(P_n) is the nXn square lattice, or grid, graph diminished by a cut across the diagonal.) - Miquel A. Fiol, Oct 05 2024
For n >= 1, also the lower matching number of the n-triangular honeycomb rook graph. - Eric W. Weisstein, Dec 14 2024
a(n-1) is also the minimal number of edges that a graph of n vertices must have such that any 3 vertices share at least one edge. - Ruediger Jehn, May 20 2025
a(n) is the number of edges of the antiregular graph A_n. This is the unique connected graph with n vertices and degrees 1 to n-1 (floor(n/2) repeated). - Allan Bickle, Jun 15 2025

Examples

			a(3) = 2, floor(3/2)*ceiling(3/2) = 2.
[ n] a(n)
---------
[ 2] 1
[ 3] 2
[ 4] 1 + 3
[ 5] 2 + 4
[ 6] 1 + 3 + 5
[ 7] 2 + 4 + 6
[ 8] 1 + 3 + 5 + 7
[ 9] 2 + 4 + 6 + 8
From _Wolfdieter Lang_, Dec 09 2014: (Start)
Tiling of a triangular shape T_N, N >= 1 with rectangles:
N=5, n=6: a(6) = 9 because all the rectangles (i, j) (modulo transposition, i.e., interchange of i and j) which are of use are:
  (5, 1)                ;  (1, 1)
  (4, 2), (4, 1)        ;  (2, 2), (2, 1)
                        ;  (3, 3), (3, 2), (3, 1)
That is (1+1) + (2+2) + 3 = 9 = a(6). Partial sums of 1, 1, 2, 2, 3, ... (A004526). (End)
Bisymmetric matrices B: 2 X 2, a(3) = 2 from B[1,1] and B[1,2]. 3 X 3, a(4) = 4 from B[1,1], B[1,2], B[1,3], and B[2,2]. - _Wolfdieter Lang_, Jul 07 2015
From _John M. Campbell_, Jan 29 2016: (Start)
Letting n=5, there are a(n)=a(5)=6 partitions of 2n+1=11 of length three with exactly two even entries:
(8,2,1) |- 2n+1
(7,2,2) |- 2n+1
(6,4,1) |- 2n+1
(6,3,2) |- 2n+1
(5,4,2) |- 2n+1
(4,4,3) |- 2n+1
(End)
From _Aaron Khan_, Jul 13 2022: (Start)
Examples of the sequence when used for rooks on a chessboard:
.
A solution illustrating a(5)=4:
  +---------+
  | B B . . |
  | B B . . |
  | . . W W |
  | . . W W |
  +---------+
.
A solution illustrating a(6)=6:
  +-----------+
  | B B . . . |
  | B B . . . |
  | B B . . . |
  | . . W W W |
  | . . W W W |
  +-----------+
(End)

References

  • Sergei Abramovich, Combinatorics of the Triangle Inequality: From Straws to Experimental Mathematics for Teachers, Spreadsheets in Education (eJSiE), Vol. 9, Issue 1, Article 1, 2016. See Fig. 3.
  • G. L. Alexanderson et al., The William Powell Putnam Mathematical Competition - Problems and Solutions: 1965-1984, M.A.A., 1985; see Problem A-1 of 27th Competition.
  • T. M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1976, page 73, problem 25.
  • Michael Doob, The Canadian Mathematical Olympiad -- L'Olympiade Mathématique du Canada 1969-1993, Canadian Mathematical Society -- Société Mathématique du Canada, Problème 9, 1970, pp 22-23, 1993.
  • H. J. Finck, On the chromatic numbers of a graph and its complement. Theory of Graphs (Proc. Colloq., Tihany, 1966) Academic Press, New York (1968), 99-113.
  • R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 1990, p. 99.
  • D. E. Knuth, The art of programming, Vol. 1, 3rd Edition, Addison-Wesley, 1997, Ex. 36 of section 1.2.4.
  • J. Nelder, Critical sets in Latin squares, CSIRO Division of Math. and Stats. Newsletter, Vol. 38 (1977), p. 4.
  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

Crossrefs

A087811 is another version of this sequence.
Cf. A024206, A072280, A002984, A007590, A000212, A118015, A056827, A118013, A128174, A000601, A115514, A189151, A063657, A171608, A005044, A030179, A275437, A004526.
Differences of A002623. Complement of A049068.
a(n) = A014616(n-2) + 2 = A033638(n) - 1 = A078126(n) + 1. Cf. A055802, A055803.
Antidiagonal sums of array A003983.
Cf. A033436 - A033444. - Reinhard Zumkeller, Nov 30 2009
Cf. A008217, A014980, A197081, A197122.
Elliptic troublemaker sequences: A000212 (= R_n(1,3) = R_n(2,3)), A007590 (= R_n(2,4)), A030511 (= R_n(2,6) = R_n(4,6)), A033436 (= R_n(1,4) = R_n(3,4)), A033437 (= R_n(1,5) = R_n(4,5)), A033438 (= R_n(1,6) = R_n(5,6)), A033439 (= R_n(1,7) = R_n(6,7)), A184535 (= R_n(2,5) = R_n(3,5)).
Cf. A077043, A060656 (2^a(n)), A344678.
Cf. A000290, A056834, A130519, A056838, A056865.
Cf. A250000 (queens on a chessboard), A176222 (kings on a chessboard), A355509 (knights on a chessboard).
Maximal product of k positive integers with sum n, for k = 2..10: this sequence (k=2), A006501 (k=3), A008233 (k=4), A008382 (k=5), A008881 (k=6), A009641 (k=7), A009694 (k=8), A009714 (k=9), A354600 (k=10).

Programs

  • GAP
    # using the formula by Paul Barry
A002620 := List([1..10^4], n-> (2*n^2 - 1 + (-1)^n)/8); # Muniru A Asiru, Feb 01 2018
  • Haskell
    a002620 = (`div` 4) . (^ 2) -- Reinhard Zumkeller, Feb 24 2012
  • Magma
    [ Floor(n/2)*Ceiling(n/2) : n in [0..40]];
  • Maple
    A002620 := n->floor(n^2/4); G002620 := series(x^2/((1-x)^2*(1-x^2)),x,60);
with(combstruct):ZL:=[st,{st=Prod(left,right),left=Set(U,card=r),right=Set(U,card=1)}, unlabeled]: subs(r=1,stack): seq(count(subs(r=2,ZL),size=m),m=0..57) ; # Zerinvary Lajos, Mar 09 2007
  • Mathematica
    Table[Ceiling[n/2] Floor[n/2], {n, 0, 56}] (* Robert G. Wilson v, Jun 18 2005 *)
LinearRecurrence[{2, 0, -2, 1}, {0, 0, 1, 2}, 60] (* Harvey P. Dale, Oct 05 2012 *)
Table[Floor[n^2/4], {n, 0, 20}] (* Eric W. Weisstein, Sep 11 2018 *)
Floor[Range[0, 20]^2/4] (* Eric W. Weisstein, Sep 11 2018 *)
CoefficientList[Series[-(x^2/((-1 + x)^3 (1 + x))), {x, 0, 20}], x] (* Eric W. Weisstein, Sep 11 2018 *)
Table[Floor[n^2/2]/2, {n, 0, 56}] (* Clark Kimberling, Dec 05 2021 *)
  • Maxima
    makelist(floor(n^2/4),n,0,50); /* Martin Ettl, Oct 17 2012 */
  • PARI
    a(n)=n^2\4
  • PARI
    (t(n)=n*(n+1)/2);for(i=1,50,print1(",",(-1)^i*sum(k=1,i,(-1)^k*t(k))))
  • PARI
    a(n)=n^2>>2 \\ Charles R Greathouse IV, Nov 11 2009
  • PARI
    x='x+O('x^100); concat([0, 0], Vec(x^2/((1-x)^2*(1-x^2)))) \\ Altug Alkan, Oct 15 2015
  • Python
    def A002620(n): return (n**2)>>2 # Chai Wah Wu, Jul 07 2022
  • Sage
    def A002620():
     x, y = 0, 1
     yield x
     while true:
         yield x
         x, y = x + y, x//y + 1
a = A002620(); print([next(a) for i in range(58)]) # Peter Luschny, Dec 17 2015

Formula

a(n) = (2*n^2-1+(-1)^n)/8. - Paul Barry, May 27 2003
G.f.: x^2/((1-x)^2*(1-x^2)) = x^2 / ( (1+x)*(1-x)^3 ). - Simon Plouffe in his 1992 dissertation, leading zeros dropped
E.g.f.: exp(x)*(2*x^2+2*x-1)/8 + exp(-x)/8.
a(n) = 2*a(n-1) - 2*a(n-3) + a(n-4). - Jaume Oliver Lafont, Dec 05 2008
a(-n) = a(n) for all n in Z.
a(n) = a(n-1) + floor(n/2), n > 0. Partial sums of A004526. - Adam Kertesz, Sep 20 2000
a(n) = a(n-1) + a(n-2) - a(n-3) + 1 [with a(-1) = a(0) = a(1) = 0], a(2k) = k^2, a(2k-1) = k(k-1). - Henry Bottomley, Mar 08 2000
0*0, 0*1, 1*1, 1*2, 2*2, 2*3, 3*3, 3*4, ... with an obvious pattern.
a(n) = Sum_{k=1..n} floor(k/2). - Yong Kong (ykong(AT)curagen.com), Mar 10 2001
a(n) = n*floor((n-1)/2) - floor((n-1)/2)*(floor((n-1)/2)+ 1); a(n) = a(n-2) + n-2 with a(1) = 0, a(2) = 0. - Santi Spadaro, Jul 13 2001
Also: a(n) = binomial(n, 2) - a(n-1) = A000217(n-1) - a(n-1) with a(0) = 0. - Labos Elemer, Apr 26 2003
a(n) = Sum_{k=0..n} (-1)^(n-k)*C(k, 2). - Paul Barry, Jul 01 2003
a(n) = (-1)^n * partial sum of alternating triangular numbers. - Jon Perry, Dec 30 2003
a(n) = A024206(n+1) - n. - Philippe Deléham, Feb 27 2004
a(n) = a(n-2) + n - 1, n > 1. - Paul Barry, Jul 14 2004
a(n+1) = Sum_{i=0..n} min(i, n-i). - Marc LeBrun, Feb 15 2005
a(n+1) = Sum_{k = 0..floor((n-1)/2)} n-2k; a(n+1) = Sum_{k=0..n} k*(1-(-1)^(n+k-1))/2. - Paul Barry, Apr 16 2005
a(n) = A108561(n+1,n-2) for n > 2. - Reinhard Zumkeller, Jun 10 2005
1 + 1/(1 + 2/(1 + 4/(1 + 6/(1 + 9/(1 + 12/(1 + 16/(1 + ...))))))) = 6/(Pi^2 - 6) = 1.550546096730... - Philippe Deléham, Jun 20 2005
a(n) = Sum_{k=0..n} Min_{k, n-k}, sums of rows of the triangle in A004197. - Reinhard Zumkeller, Jul 27 2005
For n > 2 a(n) = a(n-1) + ceiling(sqrt(a(n-1))). - Jonathan Vos Post, Jan 19 2006
Sequence starting (2, 2, 4, 6, 9, ...) = A128174 (as an infinite lower triangular matrix) * vector [1, 2, 3, ...]; where A128174 = (1; 0,1; 1,0,1; 0,1,0,1; ...). - Gary W. Adamson, Jul 27 2007
a(n) = Sum_{i=k..n} P(i, k) where P(i, k) is the number of partitions of i into k parts. - Thomas Wieder, Sep 01 2007
a(n) = sum of row (n-2) of triangle A115514. - Gary W. Adamson, Oct 25 2007
For n > 1: gcd(a(n+1), a(n)) = a(n+1) - a(n). - Reinhard Zumkeller, Apr 06 2008
a(n+3) = a(n) + A000027(n) + A008619(n+1) = a(n) + A001651(n+1) with a(1) = 0, a(2) = 0, a(3) = 1. - Yosu Yurramendi, Aug 10 2008
a(2n) = A000290(n). a(2n+1) = A002378(n). - Gary W. Adamson, Nov 29 2008
a(n+1) = a(n) + A110654(n). - Reinhard Zumkeller, Aug 06 2009
a(n) = Sum_{k=0..n} (k mod 2)*(n-k); Cf. A000035, A001477. - Reinhard Zumkeller, Nov 05 2009
a(n-1) = (n*n - 2*n + n mod 2)/4. - Ctibor O. Zizka, Nov 23 2009
a(n) = round((2*n^2-1)/8) = round(n^2/4) = ceiling((n^2-1)/4). - Mircea Merca, Nov 29 2010
n*a(n+2) = 2*a(n+1) + (n+2)*a(n). Holonomic Ansatz with smallest order of recurrence. - Thotsaporn Thanatipanonda, Dec 12 2010
a(n+1) = (n*(2+n) + n mod 2)/4. - Fred Daniel Kline, Sep 11 2011
a(n) = A199332(n, floor((n+1)/2)). - Reinhard Zumkeller, Nov 23 2011
a(n) = floor(b(n)) with b(n) = b(n-1) + n/(1+e^(1/n)) and b(0)= 0. - Richard R. Forberg, Jun 08 2013
a(n) = Sum_{i=1..floor((n+1)/2)} (n+1)-2i. - Wesley Ivan Hurt, Jun 09 2013
a(n) = floor((n+2)/2 - 1)*(floor((n+2)/2)-1 + (n+2) mod 2). - Wesley Ivan Hurt, Jun 09 2013
Sum_{n>=2} 1/a(n) = 1 + zeta(2) = 1+A013661. - Enrique Pérez Herrero, Jun 30 2013
Empirical: a(n-1) = floor(n/(e^(4/n)-1)). - Richard R. Forberg, Jul 24 2013
a(n) = A007590(n)/2. - Wesley Ivan Hurt, Mar 08 2014
A237347(a(n)) = 3; A235711(n) = A003415(a(n)). - Reinhard Zumkeller, Mar 18 2014
A240025(a(n)) = 1. - Reinhard Zumkeller, Jul 05 2014
0 = a(n)*a(n+2) + a(n+1)*(-2*a(n+2) + a(n+3)) for all integers n. - Michael Somos, Nov 22 2014
a(n) = Sum_{j=1..n} Sum_{i=1..n} ceiling((i+j-n-1)/2). - Wesley Ivan Hurt, Mar 12 2015
a(4n+1) = A002943(n) for all n>=0. - M. F. Hasler, Oct 11 2015
a(n+2)-a(n-2) = A004275(n+1). - Anton Zakharov, May 11 2017
a(n) = floor(n/2)*floor((n+1)/2). - Bruno Berselli, Jun 08 2017
a(n) = a(n-3) + floor(3*n/2) - 2. - Yuchun Ji, Aug 14 2020
a(n)+a(n+1) = A000217(n). - R. J. Mathar, Mar 13 2021
a(n) = A004247(n,floor(n/2)). - Logan Pipes, Jul 08 2021
a(n) = floor(n^2/2)/2. - Clark Kimberling, Dec 05 2021
Sum_{n>=2} (-1)^n/a(n) = Pi^2/6 - 1. - Amiram Eldar, Mar 10 2022

A152877 Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k consecutive triples of the form (odd,even,odd) and (even,odd,even) (0<=k<=n-2).

Original entry on oeis.org

1, 1, 2, 4, 2, 16, 0, 8, 60, 24, 24, 12, 288, 144, 216, 0, 72, 1584, 1296, 1152, 576, 288, 144, 10368, 9216, 10368, 4608, 4608, 0, 1152, 74880, 83520, 86400, 60480, 31680, 17280, 5760, 2880, 604800, 748800, 892800, 576000, 460800, 172800, 144000, 0, 28800
Offset: 0

Views

Author

Emeric Deutsch, Dec 17 2008

Keywords

Comments

Row n has n-1 entries (n>=2).
Sum of entries in row n is n! (A000142(n)).
T(n,0) = A152876(n).
T(n,n-2) = A092186(n).
T(2n+1,2n-2) = A047677(n) = 2*n!*(n+1)!. - Alois P. Heinz, Nov 10 2013

Examples

			T(3,1) = 2 because we have 123 and 321.
Triangle starts:
      1;
      1;
      2;
      4,    2;
     16,    0,     8;
     60,   24,    24,   12;
    288,  144,   216,    0,   72;
   1584, 1296,  1152,  576,  288, 144;
  10368, 9216, 10368, 4608, 4608,   0, 1152;
  ...

Links

Crossrefs

Cf. A000142, A047677, A152876, A092186, A329550.

Programs

  • Maple
    b:= proc(o, u, t) option remember; `if`(u+o=0, 1, expand(
      o*b(o-1, u, [2, 2, 5, 5, 2][t])*`if`(t=4, x, 1)+
      u*b(o, u-1, [3, 4, 3, 3, 4][t])*`if`(t=5, x, 1)))
    end:
T:= n-> (p-> seq(coeff(p, x, i), i=0..degree(p)))(
               b(ceil(n/2), floor(n/2), 1)):
seq(T(n), n=0..12);  # Alois P. Heinz, Nov 10 2013
  • Mathematica
    b[o_, u_, t_] := b[o, u, t] = If[u+o == 0, 1, Expand[o*b[o-1, u, {2, 2, 5, 5, 2}[[t]]]*If[t == 4, x, 1] + u*b[o, u-1, {3, 4, 3, 3, 4}[[t]]]*If[t == 5, x, 1]]]; T[n_] := Function[{p}, Table[Coefficient[p, x, i], {i, 0, Exponent[p, x]}]] [b[Ceiling[n/2], Floor[n/2], 1]]; Table[T[n], {n, 0, 12}] // Flatten (* Jean-François Alcover, May 27 2015, after Alois P. Heinz *)

Formula

It would be good to have a formula or generating function for this sequence (a formula for column 0 is given in A152876).
Sum_{k>=1} k*T(n,k) = A329550(n). - Alois P. Heinz, Nov 16 2019

Extensions

More terms from Alois P. Heinz, Nov 10 2013

A125300 Tanimoto triangle read by rows: T(n,k) = number of "parity-alternating permutations" (PAPS) of n symbols with k ascents.

Original entry on oeis.org

1, 1, 1, 1, 0, 1, 1, 3, 3, 1, 1, 2, 6, 2, 1, 1, 9, 26, 26, 9, 1, 1, 8, 39, 48, 39, 8, 1, 1, 23, 165, 387, 387, 165, 23, 1, 1, 22, 228, 674, 1030, 674, 228, 22, 1, 1, 53, 860, 4292, 9194, 9194, 4292, 860, 53, 1, 1, 52, 1149, 7136, 20738, 28248, 20738, 7136, 1149, 52, 1
Offset: 1

Views

Author

Jonathan Vos Post, Dec 08 2006, Dec 11 2006

Keywords

Comments

A permutation is a parity-alternating permutation (PAP) if its entries take even and odd integers alternately (examples: 436125, 563412 or 7216345). When n is an odd integer, odd entries must appear at both ends of PAPs. T(n,k) = the number of PAPs of {1,2,...,n} with exactly k ascents. Row sums = 2*((n/2)!)^2 if n is even and ((n+1)/2)!*((n-1)/2)! if n is odd.
Arises in combinatorial analysis of signed Eulerian numbers and parity-alternate permutations. This table is the first of three tables on p. 4 of the Tanimoto reference.

Examples

			Triangle begins:
n=1.|.1
n=2.|.1....1
n=3.|.1....0....1
n=4.|.1....3....3....1
n=5.|.1....2....6....2....1
n=6.|.1....9...26...26....9....1
n=7.|.1....8...39...48...39....8....1
n=8.|.1...23..165..387..387..165...23....1
n=9.|.1...22..228..674.1030..674..228...22....1
n=10|.1...53..860.4292.9194.9194.4292..860...53....1
Examples of parity-alternating permutations of n=5 and their number of rises k are [1,2,3,4,5] (k=4, only rises), [1,2,5,4,3] (k=2: 1->2 and 2->5), [1,4,3,2,5] (k=2: 1->4 and 2->5).  The T(n=5,k=1)=2 parity-alternating permutations with k=1 rise are [3,2,5,4,1] and [5,2,1,4,3].

Links

Crossrefs

Cf. A008292 = Triangle of Eulerian numbers T(n, k) read by rows, A049061 = Triangle a(n, k) (1<=k<=n) of signed Eulerian numbers.
Row sums give: A092186. - Alois P. Heinz, Nov 18 2013

Programs

  • Maple
    isPAP := proc(per) local i ; for i from 2 to nops(per) do if ( op(i,per) mod 2 ) = (op(i-1,per) mod 2 ) then RETURN(false) ; fi ; od : RETURN(true) ; end: ascents := proc(per) local i, asc ; asc :=0 ; for i from 2 to nops(per) do if op(i,per) > op (i-1,per) then asc := asc+1 : fi ; od : RETURN(asc) ; end:
A125300row := proc(n) local per,resul, asc,thisp,p,i,row ; row := array(0..n-1) ; for i from 0 to n-1 do row[i] := 0 : od ; per := combinat[permute](n) ; for p from 1 to nops(per) do asc := 0 ; thisp := op(p,per) ; if isPAP(thisp) then asc := ascents(thisp) ; row[asc] := row[asc]+1 ; fi ; od ; RETURN(row) : end: for n from 2 to 10 do r := A125300row(n) ; for k from 0 to n-1 do print(r[k]) ; od : od : # R. J. Mathar, Dec 12 2006
  • Mathematica
    isPAP[per_] := (For[i = 2, i <= Length[per], i++, If [Mod[per[[i]], 2] == Mod[per[[i - 1]], 2], Return[False] ] ]; True);
ascents[per_] := (asc = 0; For[i = 2, i <= Length[per], i++, If[per[[i]] > per[[i - 1]],  asc ++] ]; asc);
A125300row[n_] := (row = Range[0, n - 1]; For[i = 0, i <= n - 1, i++, row[[i]] = 0]; per = Permutations[Range[n]]; For[p = 1, p <= Length[per], p++, asc = 0; thisp = per[[p]]; If[isPAP[thisp], asc = ascents[thisp]; row[[asc]] += 1]]; row);
Join[{1}, Reap[For[n = 2, n <= 10, n++, r = A125300row[n]; For[k = 0, k <= n - 1, k++, Print[r[[k]]]; Sow[r[[k]]]]]][[2, 1]]] (* Jean-François Alcover, Nov 07 2017, after R. J. Mathar's Maple code *)

Formula

T(n,k) = T(n,n-k-1).

Extensions

Corrected by R. J. Mathar, Dec 12 2006
Edited by N. J. A. Sloane, Dec 21 2006
Replaced arXiv URL by non-cached version - R. J. Mathar, Oct 30 2009
More terms from Alois P. Heinz, Nov 18 2013

A152874 Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} with k parity changes (n>=2; 1<=k <=n-1); the permutation 372185946 has 5 parity changes: 37-2-1-8-59-46.

Original entry on oeis.org

2, 4, 2, 8, 8, 8, 24, 36, 48, 12, 72, 144, 288, 144, 72, 288, 720, 1728, 1296, 864, 144, 1152, 3456, 10368, 10368, 10368, 3456, 1152, 5760, 20160, 69120, 86400, 103680, 51840, 23040, 2880, 28800, 115200, 460800, 691200, 1036800, 691200, 460800, 115200, 28800
Offset: 2

Views

Author

Emeric Deutsch, Dec 15 2008

Keywords

Comments

Sum of entries in row n is n! (A000142(n)).
T(n,n-1) = A092186(n).
T(n,1) = A152875(n).
Sum_{k=1..n-1} k*T(n,k) = 2*A077613(n).

Examples

			T(4,3) = 8 because we have 1243, 1423, 4132, 4312, 2134, 2314, 3241 and 3421.
Triangle starts:
   2;
   4,   2;
   8,   8,   8;
  24,  36,  48,  12;
  72, 144, 288, 144,  72;
  ...

Links

Crossrefs

Cf. A000142, A077613, A092186.
T(2n,n) gives A363180.

Programs

  • Maple
    ae := proc (n, k) if `mod`(k, 2) = 0 then 2*factorial(n)^2*binomial(n-1, (1/2)*k-1)*binomial(n-1, (1/2)*k) else 2*factorial(n)^2*binomial(n-1, (1/2)*k-1/2)^2 end if end proc: ao := proc (n, k) if `mod`(k, 2) = 0 then factorial(n)*factorial(n+1)*(binomial(n, (1/2)*k)*binomial(n-1, (1/2)*k-1)+binomial(n, (1/2)*k-1)*binomial(n-1, (1/2)*k)) else 2*factorial(n)*factorial(n+1)*binomial(n, (1/2)*k-1/2)*binomial(n-1, (1/2)*k-1/2) end if end proc: T := proc (n, k) if `mod`(n, 2) = 0 then ae((1/2)*n, k) else ao((1/2)*n-1/2, k) end if end proc: for n from 2 to 10 do seq(T(n, k), k = 1 .. n-1) end do; # yields sequence in triangular form
# second Maple program:
b:= proc(x, y, t) option remember; `if`(x+y=0, 1, `if`(x>0,
      b(x-1, y, z)*x, 0)+`if`(y>0, expand(b(y-1, x, z)*y*t), 0))
    end:
T:= n-> (h-> (p-> seq(coeff(p, z, i), i=1..n-1))(b(h, n-h, 1)))(iquo(n, 2)):
seq(T(n), n=2..12);  # Alois P. Heinz, May 23 2023
  • Mathematica
    b[x_, y_, t_] := b[x, y, t] = If[x + y == 0, 1, If[x > 0, b[x - 1, y, z]*x, 0] + If[y > 0, Expand[b[y - 1, x, z]*y*t], 0]];
T[n_] := Table[Coefficient[#, z, i], {i, 1, n-1}]&[b[#, n-#, 1]]&[ Quotient[n, 2]];
Table[T[n], {n, 2, 12}] // Flatten (* Jean-François Alcover, Aug 16 2023, after Alois P. Heinz *)

Formula

T(2n,k) = (n!)^2*a(n,k), where a(n,k) is the number of lattice paths from (0,0) to (n,n) with steps N=(0,1) and E=(1,0) and having k turns;
a(n,k) = 2*binomial(n-1,k/2-1)*binomial(n-1,k/2) if k even;
a(n,k) = 2*(binomial(n-1,(k-1)/2))^2 if k odd.
T(2n+1,k) = n!*(n+1)!*b(n,k), where b(n,k) is the number of lattice paths from (0,0) to (n,n+1) with steps N=(0,1) and E=(1,0) and having k turns;
b(n,k) = binomial(n,k/2)*binomial(n-1,k/2-1) + binomial(n,k/2-1)*binomial(n-1,k/2) = (binomial(n,k/2))^2*k(2n-k+1)/(n(2n-k+2)) if k even;
b(n,k) = 2*binomial(n,(k-1)/2)*binomial(n-1,(k-1)/2) if k odd.

A062870 Number of permutations of degree n with greatest sum of distances.

Original entry on oeis.org

1, 1, 1, 3, 4, 20, 36, 252, 576, 5184, 14400, 158400, 518400, 6739200, 25401600, 381024000, 1625702400, 27636940800, 131681894400, 2501955993600, 13168189440000, 276531978240000, 1593350922240000, 36647071211520000, 229442532802560000, 5736063320064000000
Offset: 0

Views

Author

Olivier Gérard, Jun 26 2001

Keywords

Comments

Number of possible values is 1,2,3,5,7,10,13,17,21,... which I conjecture to be A033638. Maximum distance divided by 2 is the same minus one, i.e., 0,1,2,4,6,9,12,16,20,... which seems to be A002620.

Examples

			(4,3,1,2) has distances (3,1,2,2), sum is 8 and there are 3 other permutations of degree 4 {3, 4, 1, 2}, {3, 4, 2, 1}, {4, 3, 2, 1} with this sum which is the maximum possible.

Links

Crossrefs

Cf. A002620, A062866, A062867, A062869.
A007590(n) is the greatest sum of distances for a permutation of degree n. - Dmitry Kamenetsky, Nov 14 2017

Programs

  • Maple
    a:= proc(n) option remember; `if`(n<2, 1+n*(n-1),
      (n*((n-1)^2*(3*n-4)*a(n-2)-4*a(n-1)))/(4*(n-1)*(3*n-7)))
    end:
seq(a(n), n=0..30);  # Alois P. Heinz, Jan 16 2014
  • Mathematica
    a[n_?EvenQ] := (n/2)!^2; a[n_?OddQ] := n*((n-1)/2)!^2; Table[a[n], {n, 0, 30}] (* Jean-François Alcover, Apr 15 2015 *)
  • PARI
    for(k=0,20,print1((2*k+1)*k!^2","(k+1)!^2",")) \\ Herman Jamke (hermanjamke(AT)fastmail.fm), Dec 27 2007

Formula

a(n) = (n/2)!^2 if n is even else n*((n-1)/2)!^2, cf. A092186. - Conjectured by Vladeta Jovovic, Aug 21 2007; proved (see the link) by Max Alekseyev, Aug 21 2007
a(n) = A062869(n,floor(n^2/4)) for n>=1. - Alois P. Heinz, Oct 02 2022

Extensions

a(10)-a(14) from Hugo Pfoertner, Sep 23 2004
More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Dec 27 2007

A363236 Number of permutations p of [n] such that each element in p has at least one neighbor with opposite parity.

Original entry on oeis.org

1, 0, 2, 2, 16, 36, 288, 1152, 10368, 57600, 604800, 4320000, 51840000, 453600000, 6147187200, 63605606400, 962415820800, 11500218777600, 192255565824000, 2605984690176000, 47721518530560000, 723526168780800000, 14407079038894080000, 241602987041095680000
Offset: 0

Views

Author

Alois P. Heinz, May 22 2023

Keywords

Examples

			a(0) = 1: (), the empty permutation.
a(1) = 0.
a(2) = 2: 12, 21.
a(3) = 2: 123, 321.
a(4) = 16: 1234, 1243, 1423, 1432, 2134, 2143, 2314, 2341, 3214, 3241, 3412, 3421, 4123, 4132, 4312, 4321.
a(5) = 36: 12345, 12354, 12534, 12543, 14325, 14352, 14523, 14532, 21345, 21543, 23145, 23541, 25143, 25341, 32145, 32154, 32514, 32541, 34125, 34152, 34512, 34521, 41325, 41523, 43125, 43521, 45123, 45321, 52134, 52143, 52314, 52341, 54123, 54132, 54312, 54321.

Links

Crossrefs

Cf. A001622, A092186, A363180, A363181.

Formula

a(n) ~ phi^n * n! / (5^(1/4) * 2^(n-1)), where phi = A001622 is the golden ratio. - Vaclav Kotesovec, May 26 2023

A232187 Number T(n,k) of parity alternating permutations of [n] with exactly k descents from odd to even numbers; triangle T(n,k), n>=0, 0<=k<=max(0,floor((n-1)/2)), read by rows.

Original entry on oeis.org

1, 1, 2, 1, 1, 5, 3, 2, 8, 2, 20, 44, 8, 6, 66, 66, 6, 114, 594, 414, 30, 24, 624, 1584, 624, 24, 864, 8784, 14544, 4464, 144, 120, 6840, 36240, 36240, 6840, 120, 8280, 147720, 471120, 353520, 55320, 840, 720, 86400, 857520, 1739520, 857520, 86400, 720, 96480
Offset: 0

Views

Author

Alois P. Heinz, Nov 20 2013

Keywords

Comments

T(2n+1,k) = T(2n+1,n-k).
T(2n+2,n) = T(2n+1,n) + T(2n+3,n+1).

Examples

			T(5,0) = 2: 12345, 34125.
T(5,1) = 8: 12543, 14325, 14523, 32145, 34521, 52143, 52341, 54123.
T(5,2) = 2: 32541, 54321.
T(6,2) = 8: 163254, 165432, 321654, 325416, 541632, 543216, 632541, 654321.
T(7,0) = 6: 1234567, 1256347, 3412567, 3456127, 5612347, 5634127.
T(7,1) = 66: 1234765, 1236547, 1236745, ..., 7456123, 7612345, 7634125.
T(7,2) = 66: 1254763, 1276543, 1432765, ..., 7652143, 7652341, 7654123.
T(7,3) = 6: 3254761, 3276541, 5432761, 5476321, 7632541, 7654321.
Triangle T(n,k) begins:
:  0 :   1;
:  1 :   1;
:  2 :   2;
:  3 :   1,    1;
:  4 :   5,    3;
:  5 :   2,    8,     2;
:  6 :  20,   44,     8;
:  7 :   6,   66,    66,     6;
:  8 : 114,  594,   414,    30;
:  9 :  24,  624,  1584,   624,   24;
: 10 : 864, 8784, 14544,  4464,  144;
: 11 : 120, 6840, 36240, 36240, 6840, 120;

Links

Crossrefs

Column k=0 gives: A199660.
Row sums give: A092186 (for n>0).
T(2n+1,n) = A000142(n).
T(2n+2,n) = A001048(n+1).

Formula

T(2n+1,k) = n! * A173018(n+1,k) = A000142(n) * A173018(n+1,k).

A152660 Triangle read by rows: T(n,k) is the number of permutations of [n] for which k is the maximal number of initial entries whose parities alternate (1 <= k <= n).

Original entry on oeis.org

1, 0, 2, 2, 2, 2, 8, 8, 0, 8, 48, 36, 12, 12, 12, 288, 216, 72, 72, 0, 72, 2160, 1440, 576, 432, 144, 144, 144, 17280, 11520, 4608, 3456, 1152, 1152, 0, 1152, 161280, 100800, 43200, 28800, 11520, 8640, 2880, 2880, 2880, 1612800, 1008000, 432000, 288000, 115200, 86400, 28800, 28800, 0, 28800
Offset: 1

Views

Author

Emeric Deutsch, Dec 12 2008

Keywords

Comments

Sum of entries in row n is n! (=A000142(n)).
T(n,n) = A092186(n) (the parity alternating permutations; see the Tanimoto reference).
T(n,1) = A152661(n).

Examples

			T(4,2)=8 because we have 1243, 1423, 2134, 2314, 3241, 3421, 4132 and 4312.
Triangle starts:
    1;
    0,   2;
    2,   2,   2;
    8,   8,   0,   8;
   48,  36,  12,  12,  12;
  288, 216,  72,  72,   0,  72;

Links

Crossrefs

Cf. A000142, A092186, A152661.

Programs

  • Maple
    T := proc (n, k) if n < k then 0 elif `mod`(n, 2) = 0 and `mod`(k, 2) = 0 then 2*factorial((1/2)*n)^2*binomial(n-k-1, (1/2)*n-(1/2)*k) elif `mod`(n, 2) = 0 and `mod`(k, 2) = 1 then 2*factorial((1/2)*n)^2*binomial(n-k-1, (1/2)*n-(1/2)*k+1/2) elif `mod`(n, 2) = 1 and `mod`(k, 2) = 0 then factorial((1/2)*n-1/2)*factorial((1/2)*n+1/2)*binomial(n-k, (1/2)*n-(1/2)*k-1/2) elif `mod`(n, 2) = 1 and k = n then factorial((1/2)*n-1/2)*factorial((1/2)*n+1/2) else factorial((1/2)*n-1/2)*factorial((1/2)*n+1/2)*binomial(n-k, (1/2)*n-(1/2)*k-1) end if end proc: for n to 10 do seq(T(n, k), k = 1 .. n) end do; # yields sequence in triangular form
  • Mathematica
    T[n0_?EvenQ, k_] := With[{n = n0/2}, 2 (n!)^2*Binomial[2 n - k - 1, n - Floor[k/2]]];
T[n1_?OddQ, k0_?EvenQ] := With[{n = (n1 - 1)/2, k = k0/2}, n! (n + 1)! * Binomial[2 n - 2 k + 1, n - k] ];
T[n1_?OddQ, k1_?OddQ] := With[{n = (n1 - 1)/2, k = (k1 - 1)/2}, n! (n+1)! * Binomial[2 n - 2 k, n - k - 1] ];
T[n1_?OddQ, n1_?OddQ] := With[{n = (n1 - 1)/2}, n! (n + 1)!];
Table[T[n, k], {n, 1, 10}, {k, 1, n}] // Flatten (* Jean-François Alcover, Nov 28 2017 *)

Formula

T(2n,k) = 2(n!)^2*binomial(2n-k-1, n-floor(k/2));
T(2n+1,2k) = n!(n+1)!*binomial(2n-2k+1, n-k);
T(2n+1,2k+1) = n!(n+1)!*binomial(2n-2k, n-k-1) if k < n;
T(2n+1,2n+1) = n!(n+1)!.
Showing 1-9 of 9 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.