A033488 -id:A033488 - cp's OEIS frontend

A003506 Triangle of denominators in Leibniz's Harmonic Triangle a(n,k), n >= 1, 1 <= k <= n.

1, 2, 2, 3, 6, 3, 4, 12, 12, 4, 5, 20, 30, 20, 5, 6, 30, 60, 60, 30, 6, 7, 42, 105, 140, 105, 42, 7, 8, 56, 168, 280, 280, 168, 56, 8, 9, 72, 252, 504, 630, 504, 252, 72, 9, 10, 90, 360, 840, 1260, 1260, 840, 360, 90, 10, 11, 110, 495, 1320, 2310, 2772, 2310, 1320, 495, 110, 11

Offset: 1

N. J. A. Sloane

Array 1/Beta(n,m) read by antidiagonals. - Michael Somos, Feb 05 2004
a(n,3) = A027480(n-2); a(n,4) = A033488(n-3). - Ross La Haye, Feb 13 2004
a(n,k) = total size of all of the elements of the family of k-size subsets of an n-element set. For example, a 2-element set, say, {1,2}, has 3 families of k-size subsets: one with 1 0-size element, one with 2 1-size elements and one with 1 2-size element; respectively, {{}}, {{1},{2}}, {{1,2}}. - Ross La Haye, Dec 31 2006
Second slice along the 1-2-plane in the cube a(m,n,o) = a(m-1,n,o) + a(m,n-1,o) + a(m,n,o-1) with a(1,0,0)=1 and a(m<>1=0,n>=0,0>=o)=0, for which the first slice is Pascal's triangle (slice read by antidiagonals). - Thomas Wieder, Aug 06 2006
Triangle, read by rows, given by [2,-1/2,1/2,0,0,0,0,0,0,...] DELTA [2,-1/2,1/2,0,0,0,0,0,0,...] where DELTA is the operator defined in A084938. - Philippe Deléham, Oct 07 2007
This sequence * [1/1, 1/2, 1/3, ...] = (1, 3, 7, 15, 31, ...). - Gary W. Adamson, Nov 14 2007
n-th row = coefficients of first derivative of corresponding Pascal's triangle row. Example: x^4 + 4x^3 + 6x^2 + 4x + 1 becomes (4, 12, 12, 4). - Gary W. Adamson, Dec 27 2007
From Paul Curtz, Jun 03 2011: (Start)
Consider
   1     1/2   1/3    1/4    1/5
  -1/2  -1/6  -1/12  -1/20  -1/30
   1/3   1/12  1/30   1/60   1/105
  -1/4  -1/20 -1/60  -1/140 -1/280
   1/5   1/30  1/105  1/280  1/630
This is an autosequence (the inverse binomial transform is the sequence signed) of the second kind: the main diagonal is 2 times the first upper diagonal.
Note that 2, 12, 60, ... = A005430(n+1), Apery numbers = 2*A002457(n). (End)
From Louis Conover (for the 9th grade G1c mathematics class at the Chengdu Confucius International School), Mar 02 2015: (Start)
The i-th order differences of n^-1 appear in the (i+1)th row.
  1,    1/2,   1/3,   1/4,    1/5,    1/6,    1/7,     1/8, ...
  1/2,  1/6,  1/12,  1/20,   1/30,   1/42,   1/56,    1/72, ...
  1/3, 1/12,  1/30,  1/60,  1/105,  1/168,  1/252,   1/360, ...
  1/4, 1/20,  1/60, 1/140,  1/280,  1/504,  1/840,  1/1320, ...
  1/5, 1/30, 1/105, 1/280,  1/630, 1/1260, 1/2310,  1/3960, ...
  1/6, 1/42, 1/168, 1/504, 1/1260, 1/2772, 1/5544, 1/12012, ...
(End)
T(n,k) is the number of edges of distance k from a fixed vertex in the n-dimensional hypercube. - Simon Burton, Nov 04 2022

			The triangle begins:
  1;
  1/2, 1/2;
  1/3, 1/6, 1/3;
  1/4, 1/12, 1/12, 1/4;
  1/5, 1/20, 1/30, 1/20, 1/5;
  ...
The triangle of denominators begins:
   1
   2   2
   3   6   3
   4  12  12    4
   5  20  30   20    5
   6  30  60   60   30    6
   7  42 105  140  105   42    7
   8  56 168  280  280  168   56    8
   9  72 252  504  630  504  252   72   9
  10  90 360  840 1260 1260  840  360  90  10
  11 110 495 1320 2310 2772 2310 1320 495 110 11

A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof, M.A.A. 2003, see 130.
B. A. Bondarenko, Generalized Pascal Triangles and Pyramids (in Russian), FAN, Tashkent, 1990, ISBN 5-648-00738-8. English translation published by Fibonacci Association, Santa Clara Univ., Santa Clara, CA, 1993; see p. 38.
G. Boole, A Treatise On The Calculus of Finite Differences, Dover, 1960, p. 26.
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 83, Problem 25.
M. Elkadi and B. Mourrain, Symbolic-numeric methods for solving polynomial equations and applications, Chap 3. of A. Dickenstein and I. Z. Emiris, eds., Solving Polynomial Equations, Springer, 2005, pp. 126-168. See p. 152.
D. Wells, The Penguin Dictionary of Curious and Interesting Numbers. Penguin Books, NY, 1986, 35.

Reinhard Zumkeller, Rows n = 1..120 of triangle, flattened
F. S. Al-Kharousi, A. Umar, and M. M. Zubairu, On injective partial Catalan monoids, arXiv:2501.00285 [math.GR], 2024. See pp. 8-9.
Boris A. Bondarenko, Generalized Pascal Triangles and Pyramids, English translation published by Fibonacci Association, Santa Clara Univ., Santa Clara, CA, 1993.
H. J. Brothers, Pascal's Prism: Supplementary Material.
D. Dumont, Matrices d'Euler-Seidel, Sem. Loth. Comb. B05c (1981) 59-78.
Yilmaz Simsek, Construction of a generalization of the Leibnitz numbers and their properties, arXiv:2011.13701 [math.NT], 2020.
Eric Weisstein's World of Mathematics, Leibniz Harmonic Triangle

Cf. A007622, A128064, A164555/A027642, A356546.
Cf. A094305, A121547, A121306, A119800, A002378, A007318.
Row sums are in A001787. Central column is A002457. Half-diagonal is in A090816. A116071, A215652.
Denominators of i-th order differences of n^-1 are given in: (1st) A002378, (2nd) A027480, (3rd) A033488, (4th) A174002, (5th) A253946. - Louis Conover, Mar 02 2015
Columns k >= 1 (offset 1): A000027, A002378, A027480, A033488, A174002, A253946(n+4), ..., with sum of reciprocals: infinity, 1, 1/2, 1/3, 1/4, 1/5, ..., respectively. - Wolfdieter Lang, Jul 20 2022

a003506 n k = a003506_tabl !! (n-1) !! (n-1)
a003506_row n = a003506_tabl !! (n-1)
a003506_tabl = scanl1 (\xs ys ->
   zipWith (+) (zipWith (+) ([0] ++ xs) (xs ++ [0])) ys) a007318_tabl
a003506_list = concat a003506_tabl
-- Reinhard Zumkeller, Nov 14 2013, Nov 17 2011

with(combstruct):for n from 0 to 11 do seq(m*count(Combination(n), size=m), m = 1 .. n) od; # Zerinvary Lajos, Apr 09 2008
A003506 := (n,k) -> k*binomial(n,k):
seq(print(seq(A003506(n,k),k=1..n)),n=1..7); # Peter Luschny, May 27 2011

L[n_, 1] := 1/n; L[n_, m_] := L[n, m] = L[n - 1, m - 1] - L[n, m - 1]; Take[ Flatten[ Table[ 1 / L[n, m], {n, 1, 12}, {m, 1, n}]], 66]
t[n_, m_] = Gamma[n]/(Gamma[n - m]*Gamma[m]); Table[Table[t[n, m], {m, 1, n - 1}], {n, 2, 12}]; Flatten[%] (* Roger L. Bagula and Gary W. Adamson, Sep 14 2008 *)
Table[k*Binomial[n,k],{n,1,7},{k,1,n}] (* Peter Luschny, May 27 2011 *)
t[n_, k_] := Denominator[n!*k!/(n+k+1)!]; Table[t[n-k, k] , {n, 0, 10}, {k, 0, n}] // Flatten (* Jean-François Alcover, Nov 28 2013 *)

A(i,j)=if(i<1||j<1,0,1/subst(intformal(x^(i-1)*(1-x)^(j-1)),x,1))

A(i,j)=if(i<1||j<1,0,1/sum(k=0,i-1,(-1)^k*binomial(i-1,k)/(j+k)))

{T(n, k) = (n + 1 - k) * binomial( n, k - 1)} /* Michael Somos, Feb 06 2011 */

T_row = lambda n: (n*(x+1)^(n-1)).list()
for n in (1..10): print(T_row(n)) # Peter Luschny, Feb 04 2017
# Assuming offset 0:
def A003506(n, k):
    return falling_factorial(n+1,n)//(factorial(k)*factorial(n-k))
for n in range(9): print([A003506(n, k) for k in range(n+1)]) # Peter Luschny, Aug 13 2022

a(n, 1) = 1/n; a(n, k) = a(n-1, k-1) - a(n, k-1) for k > 1.
Considering the integer values (rather than unit fractions): a(n, k) = k*C(n, k) = n*C(n-1, k-1) = a(n, k-1)*a(n-1, k-1)/(a(n, k-1) - a(n-1, k-1)) = a(n-1, k) + a(n-1, k-1)*k/(k-1) = (a(n-1, k) + a(n-1, k-1))*n/(n-1) = k*A007318(n, k) = n*A007318(n-1, k-1). Row sums of integers are n*2^(n-1) = A001787(n); row sums of the unit fractions are A003149(n-1)/A000142(n). - Henry Bottomley, Jul 22 2002
From Vladeta Jovovic, Nov 01 2003: (Start)
G.f.: x*y/(1-x-y*x)^2.
E.g.f.: x*y*exp(x+x*y). (End)
T(n,k) = n*binomial(n-1,k-1) = n*A007318(n-1,k-1). - Philippe Deléham, Aug 04 2006
Binomial transform of A128064(unsigned). - Gary W. Adamson, Aug 29 2007
From Roger L. Bagula and Gary W. Adamson, Sep 14 2008: (Start)
t(n,m) = Gamma(n)/(Gamma(n - m)*Gamma(m)).
f(s,n) = Integral_{x=0..oo} exp(-s*x)*x^n dx = Gamma(n)/s^n; t(n,m) = f(s,n)/(f(s,n-m)*f(s,m)) = Gamma(n)/(Gamma(n - m)*Gamma(m)); the powers of s cancel out. (End)
From Reinhard Zumkeller, Mar 05 2010: (Start)
T(n,5) = T(n,n-4) = A174002(n-4) for n > 4.
T(2*n,n) = T(2*n,n+1) = A005430(n). (End)
T(n,k) = 2*T(n-1,k) + 2*T(n-1,k-1) - T(n-2,k) - 2*T(n-2,k-1) - T(n-2,k-2), T(1,1) = 1 and, for n > 1, T(n,k) = 0 if k <= 1 or if k > n. - Philippe Deléham, Mar 17 2012
T(n,k) = Sum_{i=1..k} i*binomial(k,i)*binomial(n+1-k,k+1-i). - Mircea Merca, Apr 11 2012
If we include a main diagonal of zeros so that the array is in the form
  0
  1   0
  2   2   0
  3   6   3   0
  4  12  12   4   0
...
then we obtain the exponential Riordan array [x*exp(x),x], which factors as [x,x]*[exp(x),x] = A132440*A007318. This array is the infinitesimal generator for A116071. A signed version of the array is the infinitesimal generator for A215652. - Peter Bala, Sep 14 2012
a(n,k) = (n-1)!/((n-k)!(k-1)!) if k > n/2 and a(n,k) = (n-1)!/((n-k-1)!k!) otherwise. [Forms 'core' for Pascal's recurrence; gives common term of RHS of T(n,k) = T(n-1,k-1) + T(n-1,k)]. - Jon Perry, Oct 08 2013
Assuming offset 0: T(n, k) = FallingFactorial(n + 1, n) / (k! * (n - k)!). The counterpart using the rising factorial is A356546. - Peter Luschny, Aug 13 2022

Edited by N. J. A. Sloane, Oct 07 2007

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

Original entry on oeis.org

0, 6, 30, 90, 210, 420, 756, 1260, 1980, 2970, 4290, 6006, 8190, 10920, 14280, 18360, 23256, 29070, 35910, 43890, 53130, 63756, 75900, 89700, 105300, 122850, 142506, 164430, 188790, 215760, 245520, 278256, 314160, 353430, 396270, 442890, 493506, 548340, 607620

Offset: 0

N. J. A. Sloane

Non-vanishing diagonal of (A132440)^4/4. Third subdiagonal of unsigned A238363 without the zero. Cf. A130534 for relations to colored forests, disposition of flags on flagpoles, and colorings of the vertices of the complete graph K_4. - Tom Copeland, Apr 05 2014
Total number of pips on a set of trominoes (3-armed dominoes) with up to n pips on each arm. - Alan Shore and N. J. A. Sloane, Jan 06 2016
Also the number of minimum connected dominating sets in the (n+2)-crown graph. - Eric W. Weisstein, Jun 29 2017
Crossing number of the (n+3)-cocktail party graph (conjectured). - Eric W. Weisstein, Apr 29 2019
Sum of all numbers in ordered triples (x,y,z) where 0 <= x <= y <= z <= n. - Edward Krogius, Jul 31 2022

			G.f. = 6*x + 30*x^2 + 90*x^3 + 210*x^4 + 420*x^5 + 756*x^6 + 1260*x^7 + ...

J. Riordan, Combinatorial Identities, Wiley, 1968, p. 77.

Vincenzo Librandi, Table of n, a(n) for n = 0..690
Steve Butler and Pavel Karasik, A note on nested sums, J. Int. Seq., Vol. 13 (2010), Article 10.4.4.
Ömür Deveci and Anthony G. Shannon, Some aspects of Neyman triangles and Delannoy arrays, Mathematica Montisnigri (2021) Vol. L, 36-43.
Sela Fried, Counting r X s rectangles in nondecreasing and Smirnov words, arXiv:2406.18923 [math.CO], 2024. See p. 9.
Aleksandar Petojević and Nenad Đapić, The vAm(a,b,c;z) function, Preprint 2013.
Luis Manuel Rivera, Integer sequences and k-commuting permutations, arXiv preprint arXiv:1406.3081 [math.CO], 2014-2015.
Hasan Unal, Proof Without Words: Sums of Products of Three Consecutive Integers, Mathematics Magazine, Vol. 88, No. 1 (February 2015), pp. 37-38.
Eric Weisstein's World of Mathematics, Cocktail Party Graph.
Eric Weisstein's World of Mathematics, Connected Dominating Set.
Eric Weisstein's World of Mathematics, Crown Party Graph.
Eric Weisstein's World of Mathematics, Graph Crossing Number.
Index entries for sequences related to Bessel functions or polynomials
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).

Cf. A000217, A000332, A002378, A033486, A033488, A034827, A050534, A130534, A132440, A238363.
Partial sums of A007531.
A row of the array in A129533.
A column of the triangle in A331430.
Sequences of the form binomial(n+k,k)*binomial(n+k+2,k): A000012 (k=0), A005563 (k=1), this sequence (k=2), A027790 (k=3), A107395 (k=4), A107396 (k=5), A107397 (k=6), A107398 (k=7), A107399 (k=8).

[n*(n+1)*(n+2)*(n+3)/4: n in [0..40]]; // Vincenzo Librandi, Apr 28 2011

[seq(binomial(n+3,4)*6, n=0..40)]; # Zerinvary Lajos, Jul 18 2006

Table[Times @@ (n + Range[0, 3])/4, {n, 0, 40}] (* Harvey P. Dale, Nov 27 2013 *)
LinearRecurrence[{5, -10, 10, -5, 1}, {0, 6, 30, 90, 210}, 40] (* Harvey P. Dale, Nov 27 2013 *)
Table[6 Binomial[n+3, 4], {n,0,40}] (* Eric W. Weisstein, Jun 29 2017 *)
Times @@@ Table[n+k, {n, 0, 40}, {k, 0, 3}]/4 (* Eric W. Weisstein, Apr 29 2019 *)

a(n)=6*binomial(n+3,4) \\ Charles R Greathouse IV, Apr 17 2012

concat(0, Vec(6*x/(1-x)^5 + O(x^100))) \\ Altug Alkan, Nov 29 2015

def A033487(n): return 6*binomial(n+3,4)
print([A033487(n) for n in range(41)]) # G. C. Greubel, Feb 08 2025

From Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Jun 10 2001: (Start)
G.f.: 6*x/(1-x)^5.
a(n) = 6*binomial(n+3, 4) = 6*A000332(n+3).
a(n) = a(n-1) + A007531(n+1).
a(n) = Sum_{i=0..n} i*(i+1)*(i+2). (End)
Constant term in Bessel polynomial {y_n(x)}''.
a(n) = binomial(n+1,2)*binomial(n+3,2) = A000217(n)*A000217(n+2). - Zerinvary Lajos, May 25 2005
a(n) = binomial(n+2,2)^2 - binomial(n+2,2). - Zerinvary Lajos, May 17 2006
From Zerinvary Lajos, May 11 2007: (Start)
a(n-1) = Sum_{j=1..n} Sum_{i=2..n} i*j.
a(n) = Sum_{j=1..n} j*(n+2)*(n-1)/2. (End)
Sum_{n>0} 1/a(n) = 2/9. - Enrique Pérez Herrero, Nov 10 2013
a(-3-n) = a(n) = 2 * binomial(binomial(n+2, 2), 2). - Michael Somos, Apr 06 2014
a(n) = A002378(binomial(n+2,2)-1). - Salvador Cerdá, Nov 04 2016
a(n) = Sum_{k=0..n} A007531(k+2). See Proof Without Words link. - Michel Marcus, Oct 29 2021
Sum_{n>=1} (-1)^(n+1)/a(n) = 16*log(2)/3 - 32/9. - Amiram Eldar, Nov 02 2021
E.g.f.: exp(x)*x*(24 + 36*x + 12*x^2 + x^3)/4. - Stefano Spezia, Jul 03 2025

A046816 Pascal's tetrahedron: entries in 3-dimensional version of Pascal triangle, or trinomial coefficients.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 2, 1, 2, 1, 1, 3, 3, 3, 6, 3, 1, 3, 3, 1, 1, 4, 4, 6, 12, 6, 4, 12, 12, 4, 1, 4, 6, 4, 1, 1, 5, 5, 10, 20, 10, 10, 30, 30, 10, 5, 20, 30, 20, 5, 1, 5, 10, 10, 5, 1, 1, 6, 6, 15, 30, 15, 20, 60, 60, 20, 15, 60, 90, 60, 15, 6, 30, 60, 60, 30, 6, 1, 6, 15, 20, 15, 6, 1

Offset: 0

Lior Manor

Greatest numbers in each 2D triangle form A022916 (multinomial coefficient n!/([n/3]![(n+1)/3]![(n+2)/3]!).) 2D triangle sums are powers of 3. - Gerald McGarvey, Aug 15 2004
T(n,j,k) is the number of lattice paths from (0,0,0) to (n,j,k) with steps (1,0,0), (1,1,0) and (1,1,1). - Dimitri Boscainos, Aug 16 2015
T(n,j,k) is the number of k-dimensional hyperfaces in an n-dimensional hypercube at an edge distance of j from a given vertex. For example, the number of 2D faces in a 3D cube touching a given vertex is T(3,0,2) = 3, and the number of 3D cube 1D edges at a separation of 1 edge from a given vertex is T(3,1,1) = 6. - Eitan Y. Levine, Jul 22 2023
The sums along vertical lines within each slice (when oriented as in the example) give A027907. See "vertical sums" link. - Eitan Y. Levine, May 17 2023
Numbers of ways to classify n circles black, red, or green; classified first by how many circles there are altogether, then by how many are of each color. - J. Lowell, Nov 06 2024

			The first few slices of the tetrahedron (or pyramid) are:
  1
-----------------
   1
  1 1
-----------------
    1
   2 2
  1 2 1
-----------------
     1 .... Here is the third slice of the pyramid
    3 3
   3 6 3
  1 3 3 1
----------------
...

Marco Costantini: Metodo per elevare qualsiasi trinomio a qualsiasi potenza. Archimede, rivista per gli insegnanti e i cultori di matematiche pure e applicate, anno XXXVIII ottobre-dicembre 1986, pp. 205-209. [Vincenzo Librandi, Jul 19 2009]

Alois P. Heinz, Table of n, a(n) for n = 0..10659
Eitan Y. Levine, Vertical sums
Wikipedia, Pascal's pyramid
Index entries for sequences related to 3D arrays of numbers

Cf. A007318, A022916.
Entry [3, 2] in each slice gives A002378, entry [4, 3] in each slice gives A027480, entry [5, 2] in each slice gives A033488, entry [5, 3] in each slice gives A033487.
See A268240 for this read mod 2.
Cf. A013609 (row sums).

a046816 n = a046816_list !! n
a046816_list = concat $ concat $ iterate ([[1],[1,1]] *) [1]
instance Num a => Num [a] where
   fromInteger k = [fromInteger k]
   (p:ps) + (q:qs) = p + q : ps + qs
   ps + qs         = ps ++ qs
   (p:ps) * qs'@(q:qs) = p * q : ps * qs' + [p] * qs
    *                = []
-- Reinhard Zumkeller, Apr 02 2011

p:= proc(i, j, k) option remember;
      if k<0 or i<0 or i>k or j<0 or j>i then 0
    elif {i, j, k}={0} then 1
    else p(i, j, k-1) +p(i-1, j, k-1) +p(i-1, j-1, k-1)
      fi
    end:
seq(seq(seq(p(i, j, k), j=0..i), i=0..k), k=0..10);
#  Alois P. Heinz, Apr 03 2011

p[i_, j_, k_] := p[i, j, k] = Which[ k<0 || i<0 || i>k || j<0 || j>i, 0, {i, j, k} == {0, 0, 0}, 1, True, p[i, j, k-1] + p[i-1, j, k-1] + p[i-1, j-1, k-1]]; Table[p[i, j, k], {k, 0, 6}, {i, 0, k}, {j, 0, i}] // Flatten (* Jean-François Alcover, Dec 31 2012, translated from Alois P. Heinz's Maple program *)
(* or *)
Flatten[CoefficientList[CoefficientList[CoefficientList[Series[1/(1-x-x*y-x*y*z), {x, 0, 6}], x], y],z]] (* Georg Fischer, May 29 2019 *)

from math import comb as C
def T(n, j, k): return C(n, j) * C(n-j, k)
print([T(n, r-c, c) for n in range(7) for r in range(n+1) for c in range(r+1)]) # Michael S. Branicky, Dec 26 2024

Coefficients of x, y, z in (x+y+z)^n: Let T'(n; i,j,k) := T(n, j,k) where i = n-(j+k). Then T'(n+1; i,j,k) = T'(n; i-1,j,k)+T'(n; i,j-1,k)+T'(n; i,j,k-1), T'(n; i,j,-1) := 0, T'(n; i,j,k) is invariant under permutations of (i,j,k); T'(0, 0, 0)=1.
T'(n; i,j,k) = n!/(i!*j!*k!) and (x+y+z)^n = Sum_{i+j+k=n; 0 <= i,j,k <= n} T'(n; i,j,k)*x^i*y^j*z^k. Hence Sum_{i+j+k=n; 0 <= i,j,k <= n} T'(n; i,j,k) = 3^n. - Gregory Gerard Wojnar, Oct 08 2020
G.f.: 1/(1-x-x*y-x*y*z). - Georg Fischer, May 29 2019
T(n,j,k) = C(n,j) * C(n-j,k), where C(a,b) are the binomial coefficients, elements of A007318. In particular, T(n,j,0) = C(n,j). - Eitan Y. Levine, Jul 22 2023
(-1)^n * Sum_{i=ceiling(n/k)..n} (-1)^i * T(i*k,n-i,i) = k^n, for n,k > 0. - Eitan Y. Levine, Aug 31 2023

A008911 a(n) = n^2*(n^2 - 1)/6.

Original entry on oeis.org

0, 0, 2, 12, 40, 100, 210, 392, 672, 1080, 1650, 2420, 3432, 4732, 6370, 8400, 10880, 13872, 17442, 21660, 26600, 32340, 38962, 46552, 55200, 65000, 76050, 88452, 102312, 117740, 134850, 153760, 174592, 197472, 222530, 249900, 279720, 312132

Offset: 0

N. J. A. Sloane, R. K. Guy

Number of equilateral triangles in rhombic portion of side n+1 in hexagonal lattice.
The hexagonal lattice is the familiar 2-dimensional lattice in which each point has 6 neighbors. This is sometimes called the triangular lattice.
Sum of squared distances on n X n board between n queens each on its own row and column. - Zak Seidov, Sep 04 2002
For queens "each on its column and row" the sum of squared distances does not depend on configuration - while sum of distances does.
Number of cycles of length 3 in the bishop's graph associated with an (n+1) X (n+1) chessboard. - Anton Voropaev (anton.n.voropaev(AT)gmail.com), Feb 01 2009
a(n) is number of ways to place 3 queens on an (n+1) X (n+1) chessboard so that they diagonally attack each other exactly 3 times. The maximal possible attack number, p=binomial(k,2)=3 for k=3 queens, is achievable only when all queens are on the same diagonal. In graph-theory representation they thus form the corresponding complete graph. - Antal Pinter, Dec 27 2015
From a(1), convolution of the oblong numbers (A002378) with the odd numbers (A005408). - Bruno Berselli, Oct 24 2016
Consider the partitions of 2n into two parts (p,q) where p <= q. Then a(n) is the total volume of the family of rectangular prisms with dimensions p, p and |q-p|. - Wesley Ivan Hurt, Apr 15 2018

			a(2)=2 because on 2 X 2 board queens "each on its column and row" may take only two angular cells, then squared distance is 1^2+1^2=2. a(3)=12 because on 3 X 3 board queens "each on its column and row" make only two essentially distinct configurations: {1,2,3}, {1,3,2} and in both cases the sum of three squared distances is 12.
G.f.: 2*x^2 + 12*x^3 + 40*x^4 + 100*x^5 + 210*x^6 + 392*x^7 + 672*x^8 + ...

James Propp, Enumeration of matchings: problems and progress, pp. 255-291 in L. J. Billera et al., eds, New Perspectives in Algebraic Combinatorics, Cambridge, 1999 (see Problem 6).

Vincenzo Librandi, Table of n, a(n) for n = 0..10000
Gabriele Nebe and N. J. A. Sloane, Home page for hexagonal (or triangular) lattice A2
James Propp, Enumeration of matchings: problems and progress, in L. J. Billera et al. (eds.), New Perspectives in Algebraic Combinatorics, 1999.
James Propp, Updated article, 2009.
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).

Cf. A002415, A006011, A047928, A083374.
Cf. A002378, A005408.
Convolution of the oblong numbers with the even numbers: A033488.

List([0..40], n-> n^2*(n^2-1)/6); # G. C. Greubel, Sep 13 2019

[n^2*(n^2-1)/6: n in [0..40]]; // Vincenzo Librandi, Sep 14 2011

A008911 := n->n^2*(n^2-1)/6; seq(A008911(n), n=0..40);

a[m_]:= m^2(m^2-1)/6;
Binomial[Range[0,40]^2, 2]/3 (* G. C. Greubel, Sep 13 2019 *)

PARI
```
{a(n) = n^2*(n^2-1)/6};
```

[n^2*(n^2-1)/6 for n in (0..40)] # G. C. Greubel, Sep 13 2019

G.f.: 2*x^2*(1+x)/(1-x)^5.
a(n) = 2*A002415(n) = A047928(n-1)/6 = A083374(n-1)/3 = A006011(n)*2/3. - Zerinvary Lajos, May 09 2007
a(n) = n*binomial(n+1,3). - Martin Renner, Apr 03 2011
a(n+1) = (n+1)*A000292(n). - Tom Copeland, Sep 13 2011
From G. C. Greubel, Sep 13 2019: (Start)
a(n) = binomial(n^2,2)/3.
E.g.f.: x^2*(6 + 6*x + x^2)*exp(x)/6. (End)
From Amiram Eldar, Nov 02 2021: (Start)
Sum_{n>=2} 1/a(n) = 21/2 - Pi^2.
Sum_{n>=2} (-1)^n/a(n) = (Pi^2 - 9)/2. (End)
a(n) = Sum_{j=0..n-1} binomial(n,2) + binomial(n,3). - Detlef Meya, Jan 20 2024

A011915 a(n) = floor(n(n-1)(n-2)*(n-3)/5).

Original entry on oeis.org

0, 0, 0, 0, 4, 24, 72, 168, 336, 604, 1008, 1584, 2376, 3432, 4804, 6552, 8736, 11424, 14688, 18604, 23256, 28728, 35112, 42504, 51004, 60720, 71760, 84240, 98280, 114004, 131544, 151032, 172608, 196416, 222604, 251328, 282744, 317016, 354312

Offset: 0

N. J. A. Sloane

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (4,-6,4,-1,1,-4,6,-4,1).

Sequences of the form floor(24*binomial(n,4)/m): A052762 (m=1), A033486 (m=2), A162668 (m=3), A033487 (m=4), this sequence (m=5), A033488 (m=6), A011917 (m=7), A050534 (m=8), A011919 (m=9), 2*A011930 (m=10), A011921 (m=11), A034827 (m=12), A011923 (m=13), A011924 (m=14), A011925 (m=15), A011926 (m=16), A011927 (m=17), A011928 (m=18), A011929 (m=19), A011930 (m=20), A011931 (m=21), A011932 (m=22), A011933 (m=23), A000332 (m=24), A011935 (m=25),A011936 (m=26), A011937 (m=27), A011938 (m=28), A011939 (m=29), A011940 (m=30), A011941 (m=31), A011942 (m=32), A011795 (m=120).

[Floor(n*(n-1)*(n-2)*(n-3)/5): n in [0..60]]; // Vincenzo Librandi, Jun 19 2012

Table[Floor[n(n-1)(n-2)(n-3)/5], {n,60}] (* Stefan Steinerberger, Apr 10 2006 *)
CoefficientList[Series[4*x^4*(1+2*x+2*x^3+x^4)/((1-x)^4*(1+x^5)),{x,0,60}],x] (* Vincenzo Librandi, Jun 19 2012 *)

[24*binomial(n,4)//5 for n in range(61)] # G. C. Greubel, Oct 20 2024

a(n) = +4*a(n-1) -6*a(n-2) +4*a(n-3) -a(n-4) +a(n-5) -4*a(n-6) +6*a(n-7) -4*a(n-8) +a(n-9).
G.f.: 4*x^4*(1+2*x+2*x^3+x^4) / ( (1-x)^5*(1+x+x^2+x^3+x^4) ). - R. J. Mathar, Apr 15 2010
a(n) = 4*A011930(n). - G. C. Greubel, Oct 20 2024

More terms from Stefan Steinerberger, Apr 10 2006

Zero added in front by R. J. Mathar, Apr 15 2010

A109649 Entries in 3-dimensional version of Pascal triangle: trinomial coefficients.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 2, 2, 1, 1, 3, 3, 1, 3, 6, 3, 3, 3, 1, 1, 4, 6, 4, 1, 4, 12, 12, 4, 6, 12, 6, 4, 4, 1, 1, 5, 10, 10, 5, 1, 5, 20, 30, 20, 5, 10, 30, 30, 10, 10, 20, 10, 5, 5, 1, 1, 6, 15, 20, 15, 6, 1, 6, 30, 60, 60, 30, 6, 15, 60, 90, 60, 15, 20, 60, 60, 20, 15, 30, 15, 6

Offset: 0

Philippe Deléham, Aug 03 2005

Greatest numbers in each 2D triangle form A022916 (multinomial coefficient n!/([n/3]![(n+1)/3]![(n+2)/3]!)).
2D triangle sums are powers of 3.
See A046816 for another version.

			.1 3 3 1 ... Here is the third slice of the pyramid
. 3 6 3
.. 3 3
... 1 .....

Cf. A022916, A046816.

Cf. A007318, A002378, A027480, A033487, A033488.

Coefficients of x, y, z in (x+y+z)^n.

A033486 a(n) = n(n + 1)(n + 2)*(n + 3)/2.

Original entry on oeis.org

0, 12, 60, 180, 420, 840, 1512, 2520, 3960, 5940, 8580, 12012, 16380, 21840, 28560, 36720, 46512, 58140, 71820, 87780, 106260, 127512, 151800, 179400, 210600, 245700, 285012, 328860, 377580, 431520, 491040, 556512, 628320, 706860, 792540, 885780, 987012

Offset: 0

N. J. A. Sloane

a(n) is the area of an irregular quadrilateral with vertices at (1,1), (n+1, n+2), ((n+1)^2, (n+2)^2) and ((n+1)^3, (n+2)^3). - Art Baker, Dec 08 2018

G. C. Greubel, Table of n, a(n) for n = 0..5000 (terms 0..680 from Vincenzo Librandi)
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).

Cf. A000332, A050534, A033488, A033487, A060008.

List([0..40],n->n*(n+1)*(n+2)*(n+3)/2); # Muniru A Asiru, Dec 08 2018

[n*(n+1)*(n+2)*(n+3)/2: n in [0..40]]; // Vincenzo Librandi, Apr 28 2011

[seq(12*binomial(n+3,4),n=0..32)]; # Zerinvary Lajos, Nov 24 2006

Table[n*(n + 1)*(n + 2)*(n + 3)/2, {n, 0, 50}] (* David Nacin, Mar 01 2012 *)
LinearRecurrence[{5,-10,10,-5,1},{0,12,60,180,420},40] (* Harvey P. Dale, Feb 04 2015 *)

a(n)=n*(n+1)*(n+2)*(n+3)/2 \\ Charles R Greathouse IV, Oct 07 2015

[12*binomial(n+3,4) for n in range(40)] # G. C. Greubel, Dec 08 2018

a(n) = 6*A034827(n+3) = 12*A000332(n+3).
G.f.: 12*x/(1 - x)^5. - Colin Barker, Mar 01 2012
a(n) = 5*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5) with a(0) = 0, a(1) = 12, a(2) = 60, a(3) = 180, a(4) = 420. - Harvey P. Dale, Feb 04 2015
E.g.f.: (24*x + 36*x^2 + 12*x^3 + x^4)*exp(x)/2. - Franck Maminirina Ramaharo, Dec 08 2018
From Amiram Eldar, Sep 04 2022: (Start)
Sum_{n>=1} 1/a(n) = 1/9.
Sum_{n>=1} (-1)^(n+1)/a(n) = 8*(3*log(2)-2)/9. (End)

A061928 Array T(n,m) = 1/beta(n+1,m+1) read by antidiagonals.

Original entry on oeis.org

6, 12, 12, 20, 30, 20, 30, 60, 60, 30, 42, 105, 140, 105, 42, 56, 168, 280, 280, 168, 56, 72, 252, 504, 630, 504, 252, 72, 90, 360, 840, 1260, 1260, 840, 360, 90, 110, 495, 1320, 2310, 2772, 2310, 1320, 495, 110, 132, 660, 1980, 3960, 5544, 5544, 3960

Offset: 1

Frank Ellermann, May 22 2001

beta(n+1,m+1) = Integral_{x=0..1} x^n * (1-x)^m dx for real n, m.

			Antidiagonals:
   6,
  12, 12,
  20, 30, 20,
  30, 60, 60, 30,
  ...
Array:
   6  12  20   30   42
  12  30  60  105  168
  20  60 140  280  504
  30 105 280  630 1260
  42 168 504 1260 2772

G. Boole, A Treatise On The Calculus of Finite Differences, Dover, 1960, p. 26.

Rows: 1/b(n, 2): A002378, 1/b(n, 3): A027480, 1/b(n, 4): A033488. Diagonals: 1/b(n, n): A002457, 1/b(n, n+1) A005430, 1/b(n, n+2): A000917.

T(i, j)=A003506(i+1, j+1).

t[n_, m_] := 1/Beta[n+1, m+1]; Take[ Flatten[ Table[ t[n+1-m, m], {n, 1, 10}, {m, 1, n}]], 52] (* Jean-François Alcover, Oct 11 2011 *)

A(i,j)=if(i<1||j<1,0,1/subst(intformal(x^i*(1-x)^j),x,1)) /* Michael Somos, Feb 05 2004 */

A(i,j)=if(i<1||j<1,0,1/sum(k=0,i,(-1)^k*binomial(i,k)/(j+1+k))) /* Michael Somos, Feb 05 2004 */

from sympy import factorial as f
def T(n, m): return f(n + m + 1)/(f(n)*f(m))
for n in range(1, 11): print([T(m, n - m + 1) for m in range(1, n + 1)]) # Indranil Ghosh, Apr 29 2017

beta(n+1, m+1) = gamma(n+1)*gamma(m+1)/gamma(n+m+2) = n!*m!/(n+m+1)!.

A210569 a(n) = (n-3)(n-2)(n-1)n(n+1)/30.

Original entry on oeis.org

0, 0, 0, 0, 4, 24, 84, 224, 504, 1008, 1848, 3168, 5148, 8008, 12012, 17472, 24752, 34272, 46512, 62016, 81396, 105336, 134596, 170016, 212520, 263120, 322920, 393120, 475020, 570024, 679644, 805504, 949344, 1113024, 1298528, 1507968, 1743588, 2007768, 2303028

Offset: 0

Bruno Berselli, Mar 23 2012

The following sequences are provided by the formula n*binomial(n,k) - binomial(n,k+1) = k*binomial(n+1,k+1):
. A000217(n)   for k=1,
. A007290(n+1) for k=2,
. A050534(n)   for k=3,
. a(n)         for k=4,
. A000910(n+1) for k=5.
Sum of reciprocals of a(n), for n>3: 5/16.
From a(2), convolution of oblong numbers (A002378) with themselves. - Bruno Berselli, Oct 24 2016

Bruno Berselli, Table of n, a(n) for n = 0..1000
C. P. Neuman and D. I. Schonbach, Evaluation of sums of convolved powers using Bernoulli numbers, SIAM Rev. 19 (1977), no. 1, 90--99. MR0428678 (55 #1698). See Table 3. - _N. J. A. Sloane_, Mar 23 2014
Index entries for linear recurrences with constant coefficients, signature (6,-15,20,-15,6,-1).

Cf. A000217, A000389, A000910, A002378, A007290, A050534, A177747.

First differences are in A033488.

Magma
```
[4*Binomial(n+1,5): n in [0..38]];
```

f:=n->(n^5-5*n^3+4*n)/30;
[seq(f(n),n=0..50)]; # N. J. A. Sloane, Mar 23 2014

LinearRecurrence[{6,-15,20,-15,6,-1}, {0,0,0,0,4,24}, 39]
CoefficientList[Series[4x^4/(1-x)^6, {x, 0, 40}], x] (* Vincenzo Librandi, Mar 24 2014 *)
Times@@@Partition[Range[-3,40],5,1]/30 (* Harvey P. Dale, Sep 19 2020 *)

makelist(coeff(taylor(4*x^4/(1-x)^6, x, 0, n), x, n), n, 0, 38);

a(n)=(n-3)*(n-2)*(n-1)*n*(n+1)/30 \\ Charles R Greathouse IV, Oct 07 2015

[4*binomial(n+1,5) for n in (0..40)] # G. C. Greubel, May 23 2022

G.f.: 4*x^4/(1-x)^6.
a(n) = n*binomial(n,4)-binomial(n,5) = 4*binomial(n+1,5) = 4*A000389(n+1).
a(n) = 2*A177747(2*n-7), with A177747(-7) = A177747(-5) = A177747(-3) = A177747(-1) = 0.
(n-4)*a(n) = (n+1)*a(n-1).
E.g.f.: (1/30)*x^4*(5+x)*exp(x). - G. C. Greubel, May 23 2022
Sum_{n>=4} (-1)^n/a(n) = 20*log(2) - 655/48. - Amiram Eldar, Jun 02 2022

A210440 a(n) = 2n(n+1)*(n+2)/3.

Original entry on oeis.org

0, 4, 16, 40, 80, 140, 224, 336, 480, 660, 880, 1144, 1456, 1820, 2240, 2720, 3264, 3876, 4560, 5320, 6160, 7084, 8096, 9200, 10400, 11700, 13104, 14616, 16240, 17980, 19840, 21824, 23936, 26180, 28560, 31080, 33744, 36556, 39520, 42640, 45920, 49364, 52976

Offset: 0

Michel Marcus, Jan 20 2013

Number of tin boxes necessary to build a tetrahedron with side length n, as shown in the link.

If "0" is prepended, a(n) is the convolution of 2n with itself. - Wesley Ivan Hurt, Mar 14 2015

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Pierre Gallais, Ceci n’est pas une mise en boîte !, Images des Mathématiques, CNRS, 2012.
Pierre Gallais, La vis ... sans fin, Images des Mathématiques, CNRS, 2012.
Jose Manuel Garcia Calcines, Luis Javier Hernandez Paricio, and Maria Teresa Rivas Rodriguez, Semi-simplicial combinatorics of cyclinders and subdivisions, arXiv:2307.13749 [math.CO], 2023. See p. 29.
Pakawut Jiradilok, Some Combinatorial Formulas Related to Diagonal Ramsey Numbers, arXiv:2404.02714 [math.CO], 2024. See p. 19.
Index entries for linear recurrences with constant coefficients, signature (4,-6,4,-1).

Cf. A000292, A028552, A033488 (partial sums), A046092, A130809.

[2*n*(n+1)*(n+2)/3: n in [0..50]]; // Vincenzo Librandi, Jun 24 2014

A210440:=n->2*n*(n+1)*(n+2)/3; seq(A210440(k), k=0..100); # Wesley Ivan Hurt, Sep 25 2013

Table[2n(n+1)(n+2)/3,{n,0,50}] (* or *) LinearRecurrence[{4,-6,4,-1},{0,4,16,40},50] (* Harvey P. Dale, Feb 13 2013 *)
CoefficientList[Series[4 x/(1 - x)^4, {x, 0, 40}], x] (* Vincenzo Librandi, Jun 24 2014 *)

A210440(n):=2*n*(n+1)*(n+2)/3$ makelist(A210440(n),n,0,20); /* Martin Ettl, Jan 22 2013 */

a(n) = 4*A000292(n).
a(n+1)-a(n) = A046092(n+1).
From Bruno Berselli, Jan 20 2013: (Start)
G.f.: 4*x/(1-x)^4.
a(n) = -a(-n-2) = 4*a(n-1)-6*a(n-2)+4*a(n-3)-a(n-4).
a(n)-a(-n) = A217873(n).
a(n)+a(-n) = A016742(n).
(n-1)*a(n)-n*a(n-1) = A130809(n+1) with n>1. (End)
From Bruno Berselli, Jan 21 2013: (Start)
a(n) = n*A028552(n) - Sum_{i=0..n-1} A028552(i) for n>0.
4*A001296(n) = n*a(n) - Sum_{i=0..n-1} a(i) for n>0. (End)
G.f.: 2*x*W(0), where W(k) = 1 + 1/(1 - x*(k+2)*(k+4)/(x*(k+2)*(k+4) + (k+1)*(k+2)/W(k+1))); (continued fraction). - Sergei N. Gladkovskii, Aug 24 2013
a(n) = Sum_{i=1..n} i*(2*n-i+3). - Wesley Ivan Hurt, Oct 03 2013
From Amiram Eldar, Apr 30 2023: (Start)
Sum_{n>=1} 1/a(n) = 3/8.
Sum_{n>=1} (-1)^(n+1)/a(n) = 3*log(2) - 15/8. (End)
E.g.f.: 2*exp(x)*x*(6 + 6*x + x^2)/3. - Stefano Spezia, Jul 11 2025

cp's OEIS Frontend

A003506 Triangle of denominators in Leibniz's Harmonic Triangle a(n,k), n >= 1, 1 <= k <= n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

PARI

PARI

SageMath

Formula

Extensions

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

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

PARI

SageMath

Formula

A046816 Pascal's tetrahedron: entries in 3-dimensional version of Pascal triangle, or trinomial coefficients.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

Python

Formula

A008911 a(n) = n^2*(n^2 - 1)/6.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

A011915 a(n) = floor(n*(n-1)*(n-2)*(n-3)/5).

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

SageMath

Formula

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

A011915 a(n) = floor(n(n-1)(n-2)*(n-3)/5).

A033486 a(n) = n(n + 1)(n + 2)*(n + 3)/2.

A210569 a(n) = (n-3)(n-2)(n-1)n(n+1)/30.

A210440 a(n) = 2n(n+1)*(n+2)/3.