150528

Appears in sequences

• Complexity of doubled cycle (regarding case n = 2 as a multigraph).at n=7A006235
• Theta series of A_7 lattice.at n=23A008447
• Triangle T(n,k), n >= 2, n+1 <= k <= 2*n-1, number of permutations p of 1,...,n, with max(p(i)+p(i-1), i=2..n) = k.at n=39A064484
• Complexity of doubled cycle (regarding case n = 2 as a graph).at n=7A072373
• a(n) = n * (n+1)^2 * (n+2)^3.at n=6A101213
• A triangle of polynomial coefficients related to Mittag-Leffler polynomials: p(x,n)=Sum[Binomial[n, k]*Binomial[n - 1, n - k]*2^k*x^k, {k, 0, n}]/(2*x).at n=41A156136
• Number of subsets S of {1,2,3,...,n} with the property that if x is a member of S then at least one of x/2 and 2x is also a member of S.at n=35A172148
• Number of subsets S of {1,2,3,...,n} with the property that if x is a member of S then at least one of x/2 and 2x is also a member of S.at n=36A172148
• Number A(n,k) of spanning trees in C_k X P_n; square array A(n,k), n>=1, k>=1, read by antidiagonals.at n=37A173958
• Define the array k(n,x) = number of m such that tau(gcd(n,m)) is x where m runs from 1 to n. Also define h(n,x) = Sum_{d|n : tau(d) = x} d. The sequence contains numbers n such that k(n,x)*x = h(n,x) has at least one solution x.at n=21A197099
• Number of spanning trees in C_8 X P_n.at n=1A210812
• Numbers that divide the product of the nonzero digits (in base 10) of their square.at n=40A218013
• Area A of the bicentric quadrilaterals such that A, the sides, the radius of the circumcircle and the radius of the incircle are integers.at n=8A219192
• Triangle read by rows. A generalization of unsigned Lah numbers, called L[2,1].at n=41A286724
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 374", based on the 5-celled von Neumann neighborhood.at n=19A287909
• Numbers k such that k + A224787(k) is a square.at n=39A386640