35322
domain: N
Appears in sequences
- Number of collinear triples in a 3 X n rectangular grid.at n=42A057566
- Partial sums of n 3-spaced triangular numbers beginning with t(3), e.g., a(2) = t(3)+t(6) = 6+21 = 27.at n=27A085788
- Second beta integer combination triangle of a Narayana type: a=2:f(n, a) = a*f(n - 1, a) + f(n - 2, a);c(n,a)=If[n == 0, 1, Product[f(i, a), {i, 1, n}]];w(n,m,q)=c(n - 1, q)*c(n, q)/(c(m - 1, q)*c(n - m, q)*c(m - 1, q)*c(n - m + 1, q)*f(m, q)).at n=17A172377
- Second beta integer combination triangle of a Narayana type: a=2:f(n, a) = a*f(n - 1, a) + f(n - 2, a);c(n,a)=If[n == 0, 1, Product[f(i, a), {i, 1, n}]];w(n,m,q)=c(n - 1, q)*c(n, q)/(c(m - 1, q)*c(n - m, q)*c(m - 1, q)*c(n - m + 1, q)*f(m, q)).at n=18A172377
- L.g.f.: -log(1 - Sum_{n>=1} x^(n^2)) = Sum_{n>=1} a(n)*x^n/n.at n=29A219331
- Least k such that the sum of the semiprime divisors equals n times the sum of the prime divisors, or 0 if no such k exists.at n=28A227419
- Integer areas A of the integer-sided triangles such that the product of the inradius and the circumradius is a square.at n=38A232329
- Number of length n+4 0..5 arrays with no five consecutive terms having four times any element equal to the sum of the remaining four.at n=1A249463
- T(n,k)=Number of length n+4 0..k arrays with no five consecutive terms having four times any element equal to the sum of the remaining four.at n=16A249466
- Number of length 2+4 0..n arrays with no five consecutive terms having four times any element equal to the sum of the remaining four.at n=4A249468
- The least positive integer in A055744 divisible by A008578(n).at n=10A256430
- Numbers A055744(n) such that for any k < n, A055744(k) and A055744(n) do not have all their prime factors in common.at n=19A256431
- The least common multiple of 1+n and 1+n^2.at n=41A281660
- a(n) = n*(2*(n - 2)*n + (-1)^n + 3)/4.at n=42A323724
- Array read by antidiagonals: T(n,k) is the number of rooted strong triangulations of a disk with n interior nodes and 3+k nodes on the boundary.at n=42A341856
- Number of strong triangulations of a fixed pentagon with n interior nodes.at n=5A341917
- Number of strictly convex unit-sided polygons with all internal angles equal to a multiple of Pi/n, treating polygons that have a unique mirror image as distinct but ignoring rotational copies.at n=17A361659