37310

Appears in sequences

• a(n) = lcm(n, n+1, n+2, n+3)/12.at n=38A067047
• Integers k such that omega(k) = omega(k-1) + omega(k-2) + omega(k-3), where omega(n) is the number of distinct prime factors of n.at n=28A076252
• Expansion of Auxiliary function L(1-m) / 4 in powers of m / 16.at n=4A078791
• Double factorial primes; values k for which k!! + 1 is prime.at n=5A080778
• Group the natural numbers >= 1 so that the n-th group contains n(n+1)/2 numbers and obtain the group sum.at n=12A095166
• Degrees of irreducible representations of orthogonal group O8-(3).at n=30A214474
• Degrees of irreducible representations of orthogonal group O8-(3).at n=31A214474
• a(n) gives the position of -n in the sequence (or tree) S generated in order by these rules: 0 is in S; if x is in S then x + 1 is in S; if nonzero x is in S then 1/x is in S; if x is in S, then i*x is in S; where duplicates are deleted as they occur.at n=12A233695
• Positions of integers in the sequence (or tree) S generated in order by these rules: 0 is in S; if x is in S then x + 1 is in S; if nonzero x is in S then 1/x is in S; if x is in S, then i*x is in S; where duplicates are deleted as they occur.at n=28A233696
• G.f.: Limit_{K->oo} Sum_{n=-oo..+oo} x^(n-K) * (1 - x^n + n*(n+1)/6 * x^(n+K))^n.at n=50A292177
• Triangle read by rows: T(n,k) is the number of labeled loop-threshold graphs on vertex set [n] with k loops, for n >= 0 and 0 <= k <= n.at n=31A350745
• Triangle read by rows: T(n,k) is the number of labeled loop-threshold graphs on vertex set [n] with k loops, for n >= 0 and 0 <= k <= n.at n=32A350745
• 32*a(n) is the denominator of the squared circumradius of a cyclic quadrilateral with sides n, n+1, n+2, n+3.at n=38A351697
• Triangle read by rows: T(n, k) = (-1)^(n + 1)*L(n) * M(n, k) where M is the inverse of the matrix generated by the triangle A368846 and L(n) is the lcm of the denominators of the terms in the n-th row of M.at n=33A369134
• a(n) = Sum_{k=0..floor(n/2)} (k+1) * binomial(k,3*(n-2*k)).at n=31A392254