50960

Appears in sequences

• a(n) = 2*(n+1)*binomial(n+3,4).at n=12A027789
• a(n) = 91*(n+1)*binomial(n+3,14)/3.at n=2A027799
• a(n) = n*(n+1)*(5*n+1)/6.at n=38A033994
• Numbers which can be written as b^2*c^2*(b^2+c^2).at n=35A063663
• First differences of harmonic (or Ore) numbers A001599.at n=34A153789
• Triangle read by rows: t(n,m) = binomial(2*n,2*m) * binomial(n,m).at n=38A155495
• Triangle read by rows: t(n,m) = binomial(2*n,2*m) * binomial(n,m).at n=42A155495
• Triangle T(n, k, m) = (m+1)^n*binomial(n,k)*f(n,m)*f(k,n-m)/n!, with T(n, 0, m) = 1, where f(n, k) = Product_{j=1..n} ( (1 - (k+1)^J)/(-k)^j ), f(n, 0) = n!, and m = 0, read by rows.at n=39A157284
• a(n) = 65*n^2.at n=27A165798
• Govindarajan's triangle D arising in enumeration of multi-dimensional partitions, read by rows.at n=35A216804
• Triangular array read by rows. T(n,k) is the number of 2-colored labeled graphs on n nodes with exactly k edges; n >= 0, 0 <= k <= A002620(n).at n=55A228890
• Irregular triangular array read by rows: T(n,k) is the number of 2-colored simple labeled graphs on n nodes that have exactly k edges, 0<=k<=A002620(n), n>=1.at n=54A241669
• Numbers k such that A122111(k) [conjugated prime factorization of k] is one of Ore's Harmonic numbers (in A001599).at n=13A336317
• Primitive numbers that are the sum of the squares of two of their distinct divisors.at n=23A338485
• a(n) is the number of large or small squares that are used to tile primitive squares of type 1 whose length of side is A344333(n).at n=20A344334
• a(n) is the number of large or small squares that are used to tile primary squares of type 1 (see A344331) whose side length is A345285(n).at n=25A345286
• Number of 4-cycles in the n X n white bishop graph.at n=27A367993
• Numbers x such that there exist three integers 0<x<=y<=z and t>0 such that sigma(x)^2 = sigma(y)^2 = sigma(z)^2 = x^2 + y^2 + z^2 + t^2.at n=31A385531