A132792 -id:A132792 - cp's OEIS frontend

A002378 Oblong (or promic, pronic, or heteromecic) numbers: a(n) = n*(n+1).

0, 2, 6, 12, 20, 30, 42, 56, 72, 90, 110, 132, 156, 182, 210, 240, 272, 306, 342, 380, 420, 462, 506, 552, 600, 650, 702, 756, 812, 870, 930, 992, 1056, 1122, 1190, 1260, 1332, 1406, 1482, 1560, 1640, 1722, 1806, 1892, 1980, 2070, 2162, 2256, 2352, 2450, 2550

Offset: 0

N. J. A. Sloane

4*a(n) + 1 are the odd squares A016754(n).
The word "pronic" (used by Dickson) is incorrect. - Michael Somos
According to the 2nd edition of Webster, the correct word is "promic". - R. K. Guy
a(n) is the number of minimal vectors in the root lattice A_n (see Conway and Sloane, p. 109).
Let M_n denote the n X n matrix M_n(i, j) = (i + j); then the characteristic polynomial of M_n is x^(n-2) * (x^2 - a(n)*x - A002415(n)). - Benoit Cloitre, Nov 09 2002
The greatest LCM of all pairs (j, k) for j < k <= n for n > 1. - Robert G. Wilson v, Jun 19 2004
First differences are a(n+1) - a(n) = 2*n + 2 = 2, 4, 6, ... (while first differences of the squares are (n+1)^2 - n^2 = 2*n + 1 = 1, 3, 5, ...). - Alexandre Wajnberg, Dec 29 2005
25 appended to these numbers corresponds to squares of numbers ending in 5 (i.e., to squares of A017329). - Lekraj Beedassy, Mar 24 2006
A rapid (mental) multiplication/factorization technique -- a generalization of Lekraj Beedassy's comment: For all bases b >= 2 and positive integers n, c, d, k with c + d = b^k, we have (n*b^k + c)*(n*b^k + d) = a(n)*b^(2*k) + c*d. Thus the last 2*k base-b digits of the product are exactly those of c*d -- including leading 0(s) as necessary -- with the preceding base-b digit(s) the same as a(n)'s. Examples: In decimal, 113*117 = 13221 (as n = 11, b = 10 = 3 + 7, k = 1, 3*7 = 21, and a(11) = 132); in octal, 61*67 = 5207 (52 is a(6) in octal). In particular, for even b = 2*m (m > 0) and c = d = m, such a product is a square of this type. Decimal factoring: 5609 is immediately seen to be 71*79. Likewise, 120099 = 301*399 (k = 2 here) and 99990000001996 = 9999002*9999998 (k = 3). - Rick L. Shepherd, Jul 24 2021
Number of circular binary words of length n + 1 having exactly one occurrence of 01. Example: a(2) = 6 because we have 001, 010, 011, 100, 101 and 110. Column 1 of A119462. - Emeric Deutsch, May 21 2006
The sequence of iterated square roots sqrt(N + sqrt(N + ...)) has for N = 1, 2, ... the limit (1 + sqrt(1 + 4*N))/2. For N = a(n) this limit is n + 1, n = 1, 2, .... For all other numbers N, N >= 1, this limit is not a natural number. Examples: n = 1, a(1) = 2: sqrt(2 + sqrt(2 + ...)) = 1 + 1 = 2; n = 2, a(2) = 6: sqrt(6 + sqrt(6 + ...)) = 1 + 2 = 3. - Wolfdieter Lang, May 05 2006
Nonsquare integers m divisible by ceiling(sqrt(m)), except for m = 0. - Max Alekseyev, Nov 27 2006
The number of off-diagonal elements of an (n + 1) X (n + 1) matrix. - Artur Jasinski, Jan 11 2007
a(n) is equal to the number of functions f:{1, 2} -> {1, 2, ..., n + 1} such that for a fixed x in {1, 2} and a fixed y in {1, 2, ..., n + 1} we have f(x) <> y. - Aleksandar M. Janjic and Milan Janjic, Mar 13 2007
Numbers m >= 0 such that round(sqrt(m+1)) - round(sqrt(m)) = 1. - Hieronymus Fischer, Aug 06 2007
Numbers m >= 0 such that ceiling(2*sqrt(m+1)) - 1 = 1 + floor(2*sqrt(m)). - Hieronymus Fischer, Aug 06 2007
Numbers m >= 0 such that fract(sqrt(m+1)) > 1/2 and fract(sqrt(m)) < 1/2 where fract(x) is the fractional part (fract(x) = x - floor(x), x >= 0). - Hieronymus Fischer, Aug 06 2007
X values of solutions to the equation 4*X^3 + X^2 = Y^2. To find Y values: b(n) = n(n+1)(2n+1). - Mohamed Bouhamida, Nov 06 2007
Nonvanishing diagonal of A132792, the infinitesimal Lah matrix, so "generalized factorials" composed of a(n) are given by the elements of the Lah matrix, unsigned A111596, e.g., a(1)*a(2)*a(3) / 3! = -A111596(4,1) = 24. - Tom Copeland, Nov 20 2007
If Y is a 2-subset of an n-set X then, for n >= 2, a(n-2) is the number of 2-subsets and 3-subsets of X having exactly one element in common with Y. - Milan Janjic, Dec 28 2007
a(n) coincides with the vertex of a parabola of even width in the Redheffer matrix, directed toward zero. An integer p is prime if and only if for all integer k, the parabola y = kx - x^2 has no integer solution with 1 < x < k when y = p; a(n) corresponds to odd k. - Reikku Kulon, Nov 30 2008
The third differences of certain values of the hypergeometric function 3F2 lead to the squares of the oblong numbers i.e., 3F2([1, n + 1, n + 1], [n + 2, n + 2], z = 1) - 3*3F2([1, n + 2, n + 2], [n + 3, n + 3], z = 1) + 3*3F2([1, n + 3, n + 3], [n + 4, n + 4], z = 1) - 3F2([1, n + 4, n + 4], [n + 5, n + 5], z = 1) = (1/((n+2)*(n+3)))^2 for n = -1, 0, 1, 2, ... . See also A162990. - Johannes W. Meijer, Jul 21 2009
Generalized factorials, [a.(n!)] = a(n)*a(n-1)*...*a(0) = A010790(n), with a(0) = 1 are related to A001263. - Tom Copeland, Sep 21 2011
For n > 1, a(n) is the number of functions f:{1, 2} -> {1, ..., n + 2} where f(1) > 1 and f(2) > 2. Note that there are n + 1 possible values for f(1) and n possible values for f(2). For example, a(3) = 12 since there are 12 functions f from {1, 2} to {1, 2, 3, 4, 5} with f(1) > 1 and f(2) > 2. - Dennis P. Walsh, Dec 24 2011
a(n) gives the number of (n + 1) X (n + 1) symmetric (0, 1)-matrices containing two ones (see [Cameron]). - L. Edson Jeffery, Feb 18 2012
a(n) is the number of positions of a domino in a rectangled triangular board with both legs equal to n + 1. - César Eliud Lozada, Sep 26 2012
a(n) is the number of ordered pairs (x, y) in [n+2] X [n+2] with |x-y| > 1. - Dennis P. Walsh, Nov 27 2012
a(n) is the number of injective functions from {1, 2} into {1, 2, ..., n + 1}. - Dennis P. Walsh, Nov 27 2012
a(n) is the sum of the positive differences of the partition parts of 2n + 2 into exactly two parts (see example). - Wesley Ivan Hurt, Jun 02 2013
a(n)/a(n-1) is asymptotic to e^(2/n). - Richard R. Forberg, Jun 22 2013
Number of positive roots in the root system of type D_{n + 1} (for n > 2). - Tom Edgar, Nov 05 2013
Number of roots in the root system of type A_n (for n > 0). - Tom Edgar, Nov 05 2013
From Felix P. Muga II, Mar 18 2014: (Start)
a(m), for m >= 1, are the only positive integer values t for which the Binet-de Moivre formula for the recurrence b(n) = b(n-1) + t*b(n-2) with b(0) = 0 and b(1) = 1 has a root of a square. PROOF (as suggested by Wolfdieter Lang, Mar 26 2014): The sqrt(1 + 4t) appearing in the zeros r1 and r2 of the characteristic equation is (a positive) integer for positive integer t precisely if 4t + 1 = (2m + 1)^2, that is t = a(m), m >= 1. Thus, the characteristic roots are integers: r1 = m + 1 and r2 = -m.
Let m > 1 be an integer. If b(n) = b(n-1) + a(m)*b(n-2), n >= 2, b(0) = 0, b(1) = 1, then lim_{n->oo} b(n+1)/b(n) = m + 1. (End)
Cf. A130534 for relations to colored forests, disposition of flags on flagpoles, and colorings of the vertices (chromatic polynomial) of the complete graphs (here simply K_2). - Tom Copeland, Apr 05 2014
The set of integers k for which k + sqrt(k + sqrt(k + sqrt(k + sqrt(k + ...) ... is an integer. - Leslie Koller, Apr 11 2014
a(n-1) is the largest number k such that (n*k)/(n+k) is an integer. - Derek Orr, May 22 2014
Number of ways to place a domino and a singleton on a strip of length n - 2. - Ralf Stephan, Jun 09 2014
With offset 1, this appears to give the maximal number of crossings between n nonconcentric circles of equal radius. - Felix Fröhlich, Jul 14 2014
For n > 1, the harmonic mean of the n values a(1) to a(n) is n + 1. The lowest infinite sequence of increasing positive integers whose cumulative harmonic mean is integral. - Ian Duff, Feb 01 2015
a(n) is the maximum number of queens of one color that can coexist without attacking one queen of the opponent's color on an (n+2) X (n+2) chessboard. The lone queen can be placed in any position on the perimeter of the board. - Bob Selcoe, Feb 07 2015
With a(0) = 1, a(n-1) is the smallest positive number not in the sequence such that Sum_{i = 1..n} 1/a(i-1) has a denominator equal to n. - Derek Orr, Jun 17 2015
The positive members of this sequence are a proper subsequence of the so-called 1-happy couple products A007969. See the W. Lang link there, eq. (4), with Y_0 = 1, with a table at the end. - Wolfdieter Lang, Sep 19 2015
For n > 0, a(n) is the reciprocal of the area bounded above by y = x^(n-1) and below by y = x^n for x in the interval [0, 1]. Summing all such areas visually demonstrates the formula below giving Sum_{n >= 1} 1/a(n) = 1. - Rick L. Shepherd, Oct 26 2015
It appears that, except for a(0) = 0, this is the set of positive integers n such that x*floor(x) = n has no solution. (For example, to get 3, take x = -3/2.) - Melvin Peralta, Apr 14 2016
If two independent real random variables, x and y, are distributed according to the same exponential distribution: pdf(x) = lambda * exp(-lambda * x), lambda > 0, then the probability that n - 1 <= x/y < n is given by 1/a(n). - Andres Cicuttin, Dec 03 2016
a(n) is equal to the sum of all possible differences between n different pairs of consecutive odd numbers (see example). - Miquel Cerda, Dec 04 2016
a(n+1) is the dimension of the space of vector fields in the plane with polynomial coefficients up to order n. - Martin Licht, Dec 04 2016
It appears that a(n) + 3 is the area of the largest possible pond in a square (A268311). - Craig Knecht, May 04 2017
Also the number of 3-cycles in the (n+3)-triangular honeycomb acute knight graph. - Eric W. Weisstein, Jul 27 2017
Also the Wiener index of the (n+2)-wheel graph. - Eric W. Weisstein, Sep 08 2017
The left edge of a Floyd's triangle that consists of even numbers: 0; 2, 4; 6, 8, 10; 12, 14, 16, 18; 20, 22, 24, 26, 28; ... giving 0, 2, 6, 12, 20, ... The right edge generates A028552. - Waldemar Puszkarz, Feb 02 2018
a(n+1) is the order of rowmotion on a poset obtained by adjoining a unique minimal (or maximal) element to a disjoint union of at least two chains of n elements. - Nick Mayers, Jun 01 2018
From Juhani Heino, Feb 05 2019: (Start)
For n > 0, 1/a(n) = n/(n+1) - (n-1)/n.
For example, 1/6 = 2/3 - 1/2; 1/12 = 3/4 - 2/3.
Corollary of this:
Take 1/2 pill.
Next day, take 1/6 pill. 1/2 + 1/6 = 2/3, so your daily average is 1/3.
Next day, take 1/12 pill. 2/3 + 1/12 = 3/4, so your daily average is 1/4.
And so on. (End)
From Bernard Schott, May 22 2020: (Start)
For an oblong number m >= 6 there exists a Euclidean division m = d*q + r with q < r < d which are in geometric progression, in this order, with a common integer ratio b. For b >= 2 and q >= 1, the Euclidean division is m = qb*(qb+1) = qb^2 * q + qb where (q, qb, qb^2) are in geometric progression.
Some examples with distinct ratios and quotients:
   6 | 4            30 | 25          42 | 18
     -----             -----            -----
   2 | 1      ,      5 |  1   ,       6 |  2    ,
and also:
  42 | 12          420 | 100
     -----             -----
   6 |  3     ,     20 |   4  .
Some oblong numbers also satisfy a Euclidean division m = d*q + r with q < r < d that are in geometric progression in this order but with a common noninteger ratio b > 1 (see A335064). (End)
For n >= 1, the continued fraction expansion of sqrt(a(n)) is [n; {2, 2n}]. For n=1, this collapses to [1; {2}]. - Magus K. Chu, Sep 09 2022
a(n-2) is the maximum irregularity over all trees with n vertices. The extremal graphs are stars. (The irregularity of a graph is the sum of the differences between the degrees over all edges of the graph.) - Allan Bickle, May 29 2023
For n > 0, number of diagonals in a regular 2*(n+1)-gon that are not parallel to any edge (cf. A367204). - Paolo Xausa, Mar 30 2024
a(n-1) is the maximum Zagreb index over all trees with n vertices. The extremal graphs are stars. (The Zagreb index of a graph is the sum of the squares of the degrees over all vertices of the graph.) - Allan Bickle, Apr 11 2024
For n >= 1, a(n) is the determinant of the distance matrix of a cycle graph on 2*n + 1 vertices (if the length of the cycle is even such a determinant is zero). - Miquel A. Fiol, Aug 20 2024
For n > 1, the continued fraction expansion of sqrt(16*a(n)) is [2n+1; {1, 2n-1, 1, 8n+2}]. - Magus K. Chu, Nov 20 2024
For n>=2, a(n) is the number of faces on a n+1-zone rhombic zonohedron. Each pair of a collection of great circles on a sphere intersects at two points, so there are 2*binomial(n+1,2) intersections. The dual of the implied polyhedron is a rhombic zonohedron, its faces corresponding to the intersections. - Shel Kaphan, Aug 12 2025

			a(3) = 12, since 2(3)+2 = 8 has 4 partitions with exactly two parts: (7,1), (6,2), (5,3), (4,4). Taking the positive differences of the parts in each partition and adding, we get: 6 + 4 + 2 + 0 = 12. - _Wesley Ivan Hurt_, Jun 02 2013
G.f. = 2*x + 6*x^2 + 12*x^3 + 20*x^4 + 30*x^5 + 42*x^6 + 56*x^7 + ... - _Michael Somos_, May 22 2014
From _Miquel Cerda_, Dec 04 2016: (Start)
a(1) = 2, since 45-43 = 2;
a(2) = 6, since 47-45 = 2 and 47-43 = 4, then 2+4 = 6;
a(3) = 12, since 49-47 = 2, 49-45 = 4, and 49-43 = 6, then 2+4+6 = 12. (End)

W. W. Berman and D. E. Smith, A Brief History of Mathematics, 1910, Open Court, page 67.
J. H. Conway and R. K. Guy, The Book of Numbers, 1996, p. 34.
J. H. Conway and N. J. A. Sloane, "Sphere Packings, Lattices and Groups", Springer-Verlag.
L. E. Dickson, History of the Theory of Numbers, Vol. 1: Divisibility and Primality. New York: Chelsea, p. 357, 1952.
L. E. Dickson, History of the Theory of Numbers, Vol. 2: Diophantine Analysis. New York: Chelsea, pp. 6, 232-233, 350 and 407, 1952.
H. Eves, An Introduction to the History of Mathematics, revised, Holt, Rinehart and Winston, 1964, page 72.
Nicomachus of Gerasa, Introduction to Arithmetic, translation by Martin Luther D'Ooge, Ann Arbor, University of Michigan Press, 1938, p. 254.
Jan Gullberg, Mathematics from the Birth of Numbers, W. W. Norton & Co., NY & London, 1997, §8.6 Figurate Numbers, p. 291.
Granino A. Korn and Theresa M. Korn, Mathematical Handbook for Scientists and Engineers, McGraw-Hill Book Company, New York (1968), pp. 980-981.
C. S. Ogilvy and J. T. Anderson, Excursions in Number Theory, Oxford University Press, 1966, pp. 61-62.
Alfred S. Posamentier, Math Charmers, Tantalizing Tidbits for the Mind, Prometheus Books, NY, 2003, pages 54-55.
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).
F. J. Swetz, From Five Fingers to Infinity, Open Court, 1994, p. 219.
James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, pages 2-6.

T. D. Noe, Table of n, a(n) for n = 0..1000
D. Applegate, M. LeBrun and N. J. A. Sloane, Dismal Arithmetic, J. Int. Seq. 14 (2011) # 11.9.8.
R. Bapat, S. J. Kirkland, and M. Neumann, On distance matrices and Laplacians, Linear Algebra Appl. 401 (2005), 193-209.
Allan Bickle and Zhongyuan Che, Irregularities of Maximal k-degenerate Graphs, Discrete Applied Math. 331 (2023) 70-87.
Allan Bickle, A Survey of Maximal k-degenerate Graphs and k-Trees, Theory and Applications of Graphs 0 1 (2024) Article 5.
Allan Bickle, Zagreb Indices of Maximal k-degenerate Graphs, Australas. J. Combin. 89 1 (2024) 167-178.
Alin Bostan, Frédéric Chyzak, and Vincent Pilaud, Refined product formulas for Tamari intervals, arXiv:2303.10986 [math.CO], 2023.
H. Bottomley, Illustration of initial terms of A000217, A002378.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 410
P. Cameron, T. Prellberg and D. Stark, Asymptotics for incidence matrix classes, Electron. J. Combin. 13 (2006), #R85, p. 11.
S. Crowley, Two new zeta constants: fractal string and hypergeometric aspects of the Riemann zeta function, viXra:1202.0066, 2012.
J. Estes and B. Wei, Sharp bounds of the Zagreb indices of k-trees, J Comb Optim 27 (2014), 271-291.
Ricardo Gómez Aíza, Trees with flowers: A catalog of integer partition and integer composition trees with their asymptotic analysis, arXiv:2402.16111 [math.CO], 2024. See p. 23.
I. Gutman and K. Das, The first Zagreb index 30 years after, MATCH Commun. Math. Comput. Chem. 50 (2004), 83-92.
Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets.
L. B. W. Jolley, Summation of Series, Dover, 1961.
Refik Keskin and Olcay Karaatli, Some New Properties of Balancing Numbers and Square Triangular Numbers, Journal of Integer Sequences, Vol. 15 (2012), Article #12.1.4.
Craig Knecht, Largest pond by area in a square.
Feihu Liu, Guoce Xin, and Chen Zhang, Ehrhart Polynomials of Order Polytopes: Interpreting Combinatorial Sequences on the OEIS, arXiv:2412.18744 [math.CO], 2024. See p. 27.
Enrique Navarrete and Daniel Orellana, Finding Prime Numbers as Fixed Points of Sequences, arXiv:1907.10023 [math.NT], 2019.
László Németh, The trinomial transform triangle, J. Int. Seqs., Vol. 21 (2018), Article #18.7.3. Also arXiv:1807.07109 [math.NT], 2018.
Lee Melvin Peralta, Solutions to the Equation [x]x = n, The Mathematics Teacher, Vol. 111, No. 2 (October 2017), pp. 150-154.
Aleksandar Petojević, A Note about the Pochhammer Symbol, Mathematica Moravica, Vol. 12-1 (2008), 37-42.
A. Petojevic and N. Dapic, The vAm(a,b,c;z) function, Preprint 2013.
Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992.
John D. Roth, David A. Garren, and R. Clark Robertson, Integer Carrier Frequency Offset Estimation in OFDM with Zadoff-Chu Sequences, IEEE Int'l Conference on Acoustics, Speech and Signal Processing (ICASSP 2021) 4850-4854.
Luis Manuel Rivera, Integer sequences and k-commuting permutations, arXiv preprint arXiv:1406.3081 [math.CO], 2014-2015.
Michelle Rudolph-Lilith, On the Product Representation of Number Sequences, with Application to the Fibonacci Family, arXiv preprint arXiv:1508.07894 [math.NT], 2015.
Amelia Carolina Sparavigna, Groupoids of OEIS A002378 and A016754 Numbers (oblong and odd square numbers), Politecnico di Torino (Italy, 2019).
Amelia Carolina Sparavigna, The groupoids of Mersenne, Fermat, Cullen, Woodall and other Numbers and their representations by means of integer sequences, Politecnico di Torino, Italy (2019), [math.NT].
J. Striker and N. Williams, Promotion and Rowmotion , arXiv preprint arXiv:1108.1172 [math.CO], 2011-2012.
D. Suprijanto and Rusliansyah, Observation on Sums of Powers of Integers Divisible by Four, Applied Mathematical Sciences, Vol. 8, 2014, no. 45, 2219 - 2226.
Leo Tavares, Square illustration
R. Tijdeman, Some applications of Diophantine approximation, pp. 261-284 of Surveys in Number Theory (Urbana, May 21, 2000), ed. M. A. Bennett et al., Peters, 2003.
G. Villemin's Almanach of Numbers, Nombres Proniques.
Eric Weisstein's World of Mathematics, Crown Graph.
Eric Weisstein's World of Mathematics, Graph Cycle.
Eric Weisstein's World of Mathematics, Pronic Number.
Eric Weisstein's World of Mathematics, Leibniz Harmonic Triangle.
Eric Weisstein's World of Mathematics, Wheel Graph.
Eric Weisstein's World of Mathematics, Wiener Index.
Wikipedia, Pronic number.
Wolfram Research, Hypergeometric Function 3F2, The Wolfram Functions site.
Index entries for "core" sequences
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Partial sums of A005843 (even numbers). Twice triangular numbers (A000217).
1/beta(n, 2) in A061928.
Cf. A035106, A087811, A119462, A127235, A049598, A124080, A033996, A028896, A046092, A000217, A005563, A046092, A001082, A059300, A059297, A059298, A166373, A002943 (bisection), A002939 (bisection), A078358 (complement).
A036689 and A036690 are subsequences. Cf. numbers of the form n*(n*k-k+4)/2 listed in A226488. - Bruno Berselli, Jun 10 2013
Row n=2 of A185651.
Cf. A007745, A169810, A213541, A005369 (characteristic function).
Cf. A281026. - Bruno Berselli, Jan 16 2017
Cf. A045943 (4-cycles in triangular honeycomb acute knight graph), A028896 (5-cycles), A152773 (6-cycles).
Sequences on the four axes of the square spiral: Starting at 0: A001107, A033991, A007742, A033954; starting at 1: A054552, A054556, A054567, A033951.
Sequences on the four diagonals of the square spiral: Starting at 0: A002939 = 2*A000384, A016742 = 4*A000290, A002943 = 2*A014105, A033996 = 8*A000217; starting at 1: A054554, A053755, A054569, A016754.
Sequences obtained by reading alternate terms on the X and Y axes and the two main diagonals of the square spiral: Starting at 0: A035608, A156859, A002378 = 2*A000217, A137932 = 4*A002620; starting at 1: A317186, A267682, A002061, A080335.
A335064 is a subsequence.
Second column of A003506.
Cf. A002378, A046092, A028896 (irregularities of maximal k-degenerate graphs).
Cf. A347213 (Dgf at s=4).
Cf. A002378, A152811, A371912 (Zagreb indices of maximal k-degenerate graphs).
Cf. A016742, A049450.

a002378 n = n * (n + 1)
a002378_list = zipWith (*) [0..] [1..]
-- Reinhard Zumkeller, Aug 27 2012, Oct 12 2011

[n*(n+1) : n in [0..100]]; // Wesley Ivan Hurt, Oct 26 2015

A002378 := proc(n)
        n*(n+1) ;
end proc:
seq(A002378(n),n=0..100) ;

Table[n(n + 1), {n, 0, 50}] (* Robert G. Wilson v, Jun 19 2004 *)
oblongQ[n_] := IntegerQ @ Sqrt[4 n + 1]; Select[Range[0, 2600], oblongQ] (* Robert G. Wilson v, Sep 29 2011 *)
2 Accumulate[Range[0, 50]] (* Harvey P. Dale, Nov 11 2011 *)
LinearRecurrence[{3, -3, 1}, {2, 6, 12}, {0, 20}] (* Eric W. Weisstein, Jul 27 2017 *)

PARI
```
{a(n) = n*(n+1)};
```

concat(0, Vec(2*x/(1-x)^3 + O(x^100))) \\ Altug Alkan, Oct 26 2015

is(n)=my(m=sqrtint(n)); m*(m+1)==n \\ Charles R Greathouse IV, Nov 01 2018

is(n)=issquare(4*n+1) \\ Charles R Greathouse IV, Mar 16 2022

def a(n): return n*(n+1)
print([a(n) for n in range(51)]) # Michael S. Branicky, Jan 13 2022

(2 to 100 by 2).scanLeft(0)( + ) // Alonso del Arte, Sep 12 2019

G.f.: 2*x/(1-x)^3. - Simon Plouffe in his 1992 dissertation.
a(n) = a(n-1) + 2*n, a(0) = 0.
Sum_{n >= 1} a(n) = n*(n+1)*(n+2)/3 (cf. A007290, partial sums).
Sum_{n >= 1} 1/a(n) = 1. (Cf. Tijdeman)
Sum_{n >= 1} (-1)^(n+1)/a(n) = log(4) - 1 = A016627 - 1 [Jolley eq (235)].
1 = 1/2 + Sum_{n >= 1} 1/(2*a(n)) = 1/2 + 1/4 + 1/12 + 1/24 + 1/40 + 1/60 + ... with partial sums: 1/2, 3/4, 5/6, 7/8, 9/10, 11/12, 13/14, ... - Gary W. Adamson, Jun 16 2003
a(n)*a(n+1) = a(n*(n+2)); e.g., a(3)*a(4) = 12*20 = 240 = a(3*5). - Charlie Marion, Dec 29 2003
Sum_{k = 1..n} 1/a(k) = n/(n+1). - Robert G. Wilson v, Feb 04 2005
a(n) = A046092(n)/2. - Zerinvary Lajos, Jan 08 2006
Log 2 = Sum_{n >= 0} 1/a(2n+1) = 1/2 + 1/12 + 1/30 + 1/56 + 1/90 + ... = (1 - 1/2) + (1/3 - 1/4) + (1/5 - 1/6) + (1/7 - 1/8) + ... = Sum_{n >= 0} (-1)^n/(n+1) = A002162. - Gary W. Adamson, Jun 22 2003
a(n) = A110660(2*n). - N. J. A. Sloane, Sep 21 2005
a(n-1) = n^2 - n = A000290(n) - A000027(n) for n >= 1. a(n) is the inverse (frequency distribution) sequence of A000194(n). - Mohammad K. Azarian, Jul 26 2007
(2, 6, 12, 20, 30, ...) = binomial transform of (2, 4, 2). - Gary W. Adamson, Nov 28 2007
a(n) = 2*Sum_{i=0..n} i = 2*A000217(n). - Artur Jasinski, Jan 09 2007, and Omar E. Pol, May 14 2008
a(n) = A006503(n) - A000292(n). - Reinhard Zumkeller, Sep 24 2008
a(n) = A061037(4*n) = (n+1/2)^2 - 1/4 = ((2n+1)^2 - 1)/4 = (A005408(n)^2 - 1)/4. - Paul Curtz, Oct 03 2008 and Klaus Purath, Jan 13 2022
a(0) = 0, a(n) = a(n-1) + 1 + floor(x), where x is the minimal positive solution to fract(sqrt(a(n-1) + 1 + x)) = 1/2. - Hieronymus Fischer, Dec 31 2008
E.g.f.: (x+2)*x*exp(x). - Geoffrey Critzer, Feb 06 2009
Product_{i >= 2} (1-1/a(i)) = -2*sin(Pi*A001622)/Pi = -2*sin(A094886)/A000796 = 2*A146481. - R. J. Mathar, Mar 12 2009, Mar 15 2009
E.g.f.: ((-x+1)*log(-x+1)+x)/x^2 also Integral_{x = 0..1} ((-x+1)*log(-x+1) + x)/x^2 = zeta(2) - 1. - Stephen Crowley, Jul 11 2009
a(A007018(n)) = A007018(n+1), i.e., A007018(n+1) = A007018(n)-th oblong numbers. - Jaroslav Krizek, Sep 13 2009
a(n) = floor((n + 1/2)^2). a(n) = A035608(n) + A004526(n+1). - Reinhard Zumkeller, Jan 27 2010
a(n) = 2*(2*A006578(n) - A035608(n)). - Reinhard Zumkeller, Feb 07 2010
a(n-1) = floor(n^5/(n^3 + n^2 + 1)). - Gary Detlefs, Feb 11 2010
For n > 1: a(n) = A173333(n+1, n-1). - Reinhard Zumkeller, Feb 19 2010
a(n) = A004202(A000217(n)). - Reinhard Zumkeller, Feb 12 2011
a(n) = A188652(2*n+1) + 1. - Reinhard Zumkeller, Apr 13 2011
For n > 0 a(n) = 1/(Integral_{x=0..Pi/2} 2*(sin(x))^(2*n-1)*(cos(x))^3). - Francesco Daddi, Aug 02 2011
a(n) = A002061(n+1) - 1. - Omar E. Pol, Oct 03 2011
a(0) = 0, a(n) = A005408(A034856(n)) - A005408(n-1). - Ivan N. Ianakiev, Dec 06 2012
a(n) = A005408(A000096(n)) - A005408(n). - Ivan N. Ianakiev, Dec 07 2012
a(n) = A001318(n) + A085787(n). - Omar E. Pol, Jan 11 2013
Sum_{n >= 1} 1/(a(n))^(2s) = Sum_{t = 1..2*s} binomial(4*s - t - 1, 2*s - 1) * ( (1 + (-1)^t)*zeta(t) - 1). See Arxiv:1301.6293. - R. J. Mathar, Feb 03 2013
a(n)^2 + a(n+1)^2 = 2 * a((n+1)^2), for n > 0. - Ivan N. Ianakiev, Apr 08 2013
a(n) = floor(n^2 * e^(1/n)) and a(n-1) = floor(n^2 / e^(1/n)). - Richard R. Forberg, Jun 22 2013
a(n) = 2*C(n+1, 2), for n >= 0. - Felix P. Muga II, Mar 11 2014
A005369(a(n)) = 1. - Reinhard Zumkeller, Jul 05 2014
Binomial transform of [0, 2, 2, 0, 0, 0, ...]. - Alois P. Heinz, Mar 10 2015
a(2n) = A002943(n) for n >= 0, a(2n-1) = A002939(n) for n >= 1. - M. F. Hasler, Oct 11 2015
For n > 0, a(n) = 1/(Integral_{x=0..1} (x^(n-1) - x^n) dx). - Rick L. Shepherd, Oct 26 2015
a(n) = A005902(n) - A007588(n). - Peter M. Chema, Jan 09 2016
For n > 0, a(n) = lim_{m -> oo} (1/m)*1/(Sum_{i=m*n..m*(n+1)} 1/i^2), with error of ~1/m. - Richard R. Forberg, Jul 27 2016
From Ilya Gutkovskiy, Jul 28 2016: (Start)
Dirichlet g.f.: zeta(s-2) + zeta(s-1).
Convolution of nonnegative integers (A001477) and constant sequence (A007395).
Sum_{n >= 0} a(n)/n! = 3*exp(1). (End)
From Charlie Marion, Mar 06 2020: (Start)
a(n)*a(n+2k-1) + (n+k)^2 = ((2n+1)*k + n^2)^2.
a(n)*a(n+2k) + k^2 = ((2n+1)*k + a(n))^2. (End)
Product_{n>=1} (1 + 1/a(n)) = cosh(sqrt(3)*Pi/2)/Pi. - Amiram Eldar, Jan 20 2021
A generalization of the Dec 29 2003 formula, a(n)*a(n+1) = a(n*(n+2)), follows. a(n)*a(n+k) = a(n*(n+k+1)) + (k-1)*n*(n+k+1). - Charlie Marion, Jan 02 2023
a(n) = A016742(n) - A049450(n). - Leo Tavares, Mar 15 2025

Additional comments from Michael Somos

Comment and cross-reference added by Christopher Hunt Gribble, Oct 13 2009

A111596 The matrix inverse of the unsigned Lah numbers A271703.

Original entry on oeis.org

1, 0, 1, 0, -2, 1, 0, 6, -6, 1, 0, -24, 36, -12, 1, 0, 120, -240, 120, -20, 1, 0, -720, 1800, -1200, 300, -30, 1, 0, 5040, -15120, 12600, -4200, 630, -42, 1, 0, -40320, 141120, -141120, 58800, -11760, 1176, -56, 1, 0, 362880, -1451520, 1693440, -846720, 211680, -28224, 2016, -72, 1

Offset: 0

Wolfdieter Lang, Aug 23 2005

Also the associated Sheffer triangle to Sheffer triangle A111595.
Coefficients of Laguerre polynomials (-1)^n * n! * L(n,-1,x), which equals (-1)^n * Lag(n,x,-1) below. Lag(n,Lag(.,x,-1),-1) = x^n evaluated umbrally, i.e., with (Lag(.,x,-1))^k = Lag(k,x,-1). - Tom Copeland, Apr 26 2014
Without row n=0 and column m=0 this is, up to signs, the Lah triangle A008297.
The unsigned column sequences are (with leading zeros): A000142, A001286, A001754, A001755, A001777, A001778, A111597-A111600 for m=1..10.
The row polynomials p(n,x) := Sum_{m=0..n} a(n,m)*x^m, together with the row polynomials s(n,x) of A111595 satisfy the exponential (or binomial) convolution identity s(n,x+y) = Sum_{k=0..n} binomial(n,k)*s(k,x)*p(n-k,y), n>=0.
Exponential Riordan array [1,x/(1+x)]. Inverse of the exponential Riordan array [1,x/(1-x)], which is the unsigned version of A111596. - Paul Barry, Apr 12 2007
For the unsigned subtriangle without column number m=0 and row number n=0, see A105278.
Unsigned triangle also matrix product |S1|*S2 of Stirling number matrices.
The unsigned row polynomials are Lag(n,-x,-1), the associated Laguerre polynomials of order -1 with negated argument. See Gradshteyn and Ryzhik, Abramowitz and Stegun and Rota (Finite Operator Calculus) for extensive formulas. - Tom Copeland, Nov 17 2007, Sep 09 2008
An infinitesimal matrix generator for unsigned A111596 is given by A132792. - Tom Copeland, Nov 22 2007
From the formalism of A132792 and A133314 for n > k, unsigned A111596(n,k) = a(k) * a(k+1)...a(n-1) / (n-k)! = a generalized factorial, where a(n) = A002378(n) = n-th term of first subdiagonal of unsigned A111596. Hence Deutsch's remark in A002378 provides an interpretation of A111596(n,k) in terms of combinations of certain circular binary words. - Tom Copeland, Nov 22 2007
Given T(n,k)= A111596(n,k) and matrices A and B with A(n,k) = T(n,k)*a(n-k) and B(n,k) = T(n,k)*b(n-k), then A*B = C where C(n,k) = T(n,k)*[a(.)+b(.)]^(n-k), umbrally. - Tom Copeland, Aug 27 2008
Operationally, the unsigned row polynomials may be expressed as p_n(:xD:) = x*:Dx:^n*x^{-1}=x*D^nx^n*x^{-1}= n!*binomial(xD+n-1,n) = (-1)^n n! binomial(-xD,n) = n!L(n,-1,-:xD:), where, by definition, :AB:^n = A^nB^n for any two operators A and B, D = d/dx, and L(n,-1,x) is the Laguerre polynomial of order -1. A similarity transformation of the operators :Dx:^n generates the higher order Laguerre polynomials, which can also be expressed in terms of rising or falling factorials or Kummer's confluent hypergeometric functions (cf. the Mathoverflow post). -  Tom Copeland, Sep 21 2019

			Binomial convolution of row polynomials: p(3,x) = 6*x-6*x^2+x^3; p(2,x) = -2*x+x^2, p(1,x) = x, p(0,x) = 1,
together with those from A111595: s(3,x) = 9*x-6*x^2+x^3; s(2,x) = 1-2*x+x^2, s(1,x) = x, s(0,x) = 1; therefore
9*(x+y)-6*(x+y)^2+(x+y)^3 = s(3,x+y) = 1*s(0,x)*p(3,y) + 3*s(1,x)*p(2,y) + 3*s(2,x)*p(1,y) +1*s(3,x)*p(0,y) = (6*y-6*y^2+y^3) + 3*x*(-2*y+y^2) + 3*(1-2*x+x^2)*y + 9*x-6*x^2+x^3.
From _Wolfdieter Lang_, Apr 28 2014: (Start)
The triangle a(n,m) begins:
n\m  0     1       2       3      4     5   6  7
0:   1
1:   0     1
2:   0    -2       1
3:   0     6      -6       1
4:   0   -24      36     -12      1
5:   0   120    -240     120    -20     1
6:   0  -720    1800   -1200    300   -30   1
7:   0  5040  -15120   12600  -4200   630 -42  1
...
For more rows see the link.
(End)

G. C. Greubel, Rows n=0..100 of triangle, flattened
Wolfdieter Lang, The first 11 rows of the triangle.
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
Paul Barry, The Restricted Toda Chain, Exponential Riordan Arrays, and Hankel Transforms, J. Int. Seq. 13 (2010) # 10.8.4, example 4.
Paul Barry, Exponential Riordan Arrays and Permutation Enumeration, J. Int. Seq. 13 (2010) # 10.9.1, example 6.
Paul Barry, Riordan Arrays, Orthogonal Polynomials as Moments, and Hankel Transforms, J. Int. Seq. 14 (2011) # 11.2.2, example 20.
Paul Barry, Combinatorial polynomials as moments, Hankel transforms and exponential Riordan arrays, arXiv preprint arXiv:1105.3044 [math.CO], 2011, also J. Int. Seq. 14 (2011) 11.6.7.
Tom Copeland, A Class of Differential Operators and the Stirling Numbers; Generators, Inversion, and Matrix, Binomial, and Integral Transforms; Lagrange a la Lah
A. Hennessy and P. Barry, Generalized Stirling Numbers, Exponential Riordan Arrays, and Orthogonal Polynomials, J. Int. Seq. 14 (2011) # 11.8.2.
M. Janjic, Some classes of numbers and derivatives, JIS 12 (2009) 09.8.3.
Mathoverflow, Pochhammer symbol of a differential, and hypergeometric polynomials, a question posed by Emilio Pisanty and answered by Tom Copeland, 2012.
J. Taylor, Counting words with Laguerre polynomials, DMTCS Proc., Vol. AS, 2013, p. 1131-1142. [_Tom Copeland_, Jan 08 2016] [Broken link]
J. Taylor, Formal group laws and hypergraph colorings, doctoral thesis, Univ. of Wash., 2016, p. 96. [_Tom Copeland_, Dec 20 2018]
Jian Zhou, On Some Mathematics Related to the Interpolating Statistics, arXiv:2108.10514 [math-ph], 2021.

Row sums: A111884. Unsigned row sums: A000262.
A002868 gives maximal element (in magnitude) in each row.
Cf. A130561 for a natural refinement.
Cf. A264428, A264429, A271703 (unsigned).
Cf. A008297, A089231, A105278 (variants).
Cf. A002378, A008277, A132792, A133314, A132792, A001263.

# The function BellMatrix is defined in A264428.
BellMatrix(n -> `if`(n::odd, -(n+1)!, (n+1)!), 9); # Peter Luschny, Jan 27 2016

a[0, 0] = 1; a[n_, m_] := ((-1)^(n-m))*(n!/m!)*Binomial[n-1, m-1]; Table[a[n, m], {n, 0, 10}, {m, 0, n}] // Flatten (* Jean-François Alcover, Jul 05 2013 *)
T[ n_, k_] := (-1)^n n! Coefficient[ LaguerreL[ n, -1, x], x, k]; (* Michael Somos, Dec 15 2014 *)
rows = 9;
t = Table[(-1)^(n+1) n!, {n, 1, rows}];
T[n_, k_] := BellY[n, k, t];
Table[T[n, k], {n, 0, rows}, {k, 0, n}]  // Flatten (* Jean-François Alcover, Jun 22 2018, after Peter Luschny *)

{T(n, k) = if( n<1 || k<1, n==0 && k==0, (-1)^n * n! * polcoeff( sum(k=1, n, binomial( n-1, k-1) * (-x)^k / k!), k))}; /* Michael Somos, Dec 15 2014 */

lah_number = lambda n, k: factorial(n-k)*binomial(n,n-k)*binomial(n-1,n-k)
A111596_row = lambda n: [(-1)^(n-k)*lah_number(n, k) for k in (0..n)]
for n in range(10): print(A111596_row(n)) # Peter Luschny, Oct 05 2014

# uses[inverse_bell_transform from A264429]
def A111596_matrix(dim):
    fact = [factorial(n) for n in (1..dim)]
    return inverse_bell_transform(dim, fact)
A111596_matrix(10) # Peter Luschny, Dec 20 2015

E.g.f. m-th column: ((x/(1+x))^m)/m!, m>=0.
E.g.f. for row polynomials p(n, x) is exp(x*y/(1+y)).
a(n, m) = ((-1)^(n-m))*|A008297(n, m)| = ((-1)^(n-m))*(n!/m!)*binomial(n-1, m-1), n>=m>=1; a(0, 0)=1; else 0.
a(n, m) = -(n-1+m)*a(n-1, m) + a(n-1, m-1), n>=m>=0, a(n, -1):=0, a(0, 0)=1; a(n, m)=0 if n|a(n,m)| = Sum_{k=m..n} |S1(n,k)|*S2(k,m), n>=0. S2(n,m):=A048993. S1(n,m):=A048994. - Wolfdieter Lang, May 04 2007
From Tom Copeland, Nov 21 2011: (Start)
For this Lah triangle, the n-th row polynomial is given umbrally by
  (-1)^n n! binomial(-Bell.(-x),n), where Bell_n(-x)= exp(x)(xd/dx)^n exp(-x), the n-th Bell / Touchard / exponential polynomial with neg. arg., (cf. A008277). E.g., 2! binomial(-Bell.(-x),2) = -Bell.(-x)*(-Bell.(-x)-1) = Bell_2(-x)+Bell_1(-x) = -2x+x^2.
A Dobinski relation is (-1)^n n! binomial(-Bell.(-x),n)= (-1)^n n! e^x Sum_{j>=0} (-1)^j binomial(-j,n)x^j/j!= n! e^x Sum_{j>=0} (-1)^j binomial(j-1+n,n)x^j/j!. See the Copeland link for the relation to inverse Mellin transform. (End)
The n-th row polynomial is (-1/x)^n e^x (x^2*D_x)^n e^(-x). - Tom Copeland, Oct 29 2012
Let f(.,x)^n = f(n,x) = x!/(x-n)!, the falling factorial,and r(.,x)^n = r(n,x) = (x-1+n)!/(x-1)!, the rising factorial, then the Lah polynomials, Lah(n,t)= n!*Sum{k=1..n} binomial(n-1,k-1)(-t)^k/k! (extra sign factor on odd rows), give the transform Lah(n,-f(.,x))= r(n,x), and Lah(n,r(.,x))= (-1)^n * f(n,x). - Tom Copeland, Oct 04 2014
|T(n,k)| = Sum_{j=0..2*(n-k)} A254881(n-k,j)*k^j/(n-k)!. Note that A254883 is constructed analogously from A254882. - Peter Luschny, Feb 10 2015
The T(n,k) are the inverse Bell transform of [1!,2!,3!,...] and |T(n,k)| are the Bell transform of [1!,2!,3!,...]. See A264428 for the definition of the Bell transform and A264429 for the definition of the inverse Bell transform. - Peter Luschny, Dec 20 2015
Dividing each n-th diagonal by n!, where the main diagonal is n=1, generates a shifted, signed Narayana matrix A001263. - Tom Copeland, Sep 23 2020

New name using a comment from Wolfdieter Lang by Peter Luschny, May 10 2021

A132710 Infinitesimal generator for a diagonally-shifted Lah matrix, unsigned A105278, related to n! Laguerre(n,-x,1).

Original entry on oeis.org

0, 2, 0, 0, 6, 0, 0, 0, 12, 0, 0, 0, 0, 20, 0, 0, 0, 0, 0, 30, 0, 0, 0, 0, 0, 0, 42, 0, 0, 0, 0, 0, 0, 0, 56, 0, 0, 0, 0, 0, 0, 0, 0, 72, 0, 0, 0, 0, 0, 0, 0, 0, 0, 90, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 110, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 132, 0

Offset: 0

Tom Copeland, Nov 15 2007, Nov 16 2007, Nov 27 2007

Analogous to the infinitesimal generators of A132681 and A132792.
The matrix T begins
0;
2, 0;
0, 6, 0;
0, 0, 12 0;
0, 0, 0, 20, 0;
Along the nonvanishing diagonal the n-th term is (n+2)*(n+1).
Let LM(t) = exp(t*T) = lim_{n->infinity} (1 + t*T/n)^n.
Shifted Lah matrix = [bin(n+1,k+1)*(n)!/(k)! ] = LM(1) = exp(T). Truncating the series gives the n X n submatrices. In fact, the submatrices of T are nilpotent with [Tsub_n]^(n+1) = 0 for n=0,1,2,....
Inverse shifted Lah matrix = LM(-1) = exp(-T)
Umbrally shifted Lah[b(.)] = exp(b(.)*T) = [ binomial(n+1,k+1)*(n)!/(k)! * b(n-k) ]
A(j) = T^j / j! equals the matrix [binomial(n+1,k+1)*(n)!/(k)! * delta(n-k-j)] where delta(n) = 1 if n=0 and vanishes otherwise (Kronecker delta); i.e. A(j) is a matrix with all the terms 0 except for the j-th lower (or main for j=0) diagonal which equals that of the Lah matrix. Hence the A(j)'s form a linearly independent basis for all matrices of the form [binomial(n+1,k+1) * (n)! / (k)! * d(n-k)].
For sequences with b(0) = 1, umbrally,
LM[b(.)] = exp(b(.)*T) = [ bin(n+1,k+1)*(n)!/(k)! * b(n-k) ] .
[LM[b(.)]]^(-1) = exp(c(.)*T) = [ bin(n+1,k+1)*(n)!/(k)! * c(n-k) ] where c = LPT(b) with LPT the list partition transform of A133314. Or,
[LM[b(.)]]^(-1) = exp[LPT(b(.))*T] = LPT[LM(b(.))] = LM[LPT(b(.))] = LM[c(.)] .
The matrix operation b = T*a can be characterized in several ways in terms of the coefficients a(n) and b(n), their o.g.f.'s A(x) and B(x), or e.g.f.'s EA(x) and EB(x).
1) b(0) = 0, b(n) = (n+1)*(n) * a(n-1),
2) B(x) = x * D^2 * x^2 A(x)
3) B(x) = x * 2 *Lag(2,-:xD:,0) A(x)
4) EB(x) = D * x^2 EA(x)
where D is the derivative w.r.t. x, (:xD:)^j = x^j*D^j and Lag(n,x,m) is the associated Laguerre polynomial of order m.
The exponentiated operator can be characterized (with loose notation) as
5) exp(t*T) * a = LM(t) * a = [sum(k=0,...,n) bin(n+1,k+1) * n!/k! t^(n-k) * a(k)] = [ t^n * n! * Lag(n,-a(.)/t,1) ], a vector array.
With t=1 and a(k) = (-x)^k, then LM(1) * a = [ n! * Laguerre(n,x,1) ], a vector array with index n .
6) exp(t*T) EA(x) = EB(x) = EA[ x / (1-x*t) ] / (1-x*t)^2

G. Hetyei, Meixner polynomials of the second kind and quantum algebras representing su(1,1), arXiv preprint arXiv:0909.4352 [math.QA], 2009, p. 4
M. Janjic, Some classes of numbers and derivatives, JIS 12 (2009) 09.8.3

Table[PadLeft[{n*(n-1), 0}, n], {n, 0, 12}] // Flatten (* Jean-François Alcover, Apr 30 2014 *)

Given a polynomial sequence p_n(x) with p_0(x)=1 and the lowering and raising operators L and R defined by L P_n(x) = n * P_(n-1)(x) and R P_n(x) = P_(n+1)(x), the matrix T represents the action of R*L^2*R^2 in the p_n(x) basis. For p_n(x) = x^n, L = D = d/dx and R = x. For p_n(x) = x^n/n!, L = DxD and R = D^(-1). - Tom Copeland, Oct 25 2012

Showing 1-3 of 3 results.

cp's OEIS Frontend

A002378 Oblong (or promic, pronic, or heteromecic) numbers: a(n) = n*(n+1).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

PARI

PARI

PARI

Python

Scala

Formula

Extensions

A111596 The matrix inverse of the unsigned Lah numbers A271703.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Sage

Sage

Formula

Extensions

A132710 Infinitesimal generator for a diagonally-shifted Lah matrix, unsigned A105278, related to n! Laguerre(n,-x,1).

Views

Author

Keywords

Comments

Links

Programs

Mathematica

Formula