56595

Appears in sequences

• Triangle read by rows: a(n,k) = number of partitions of an n-set into exactly k nonempty subsets, each of size <= 3.at n=61A111246
• a(n) = product{k=1 to n} (k-th integer from among those positive integers which are coprime to (n+1-k)).at n=6A130767
• a(n) = (15*n^2+45*n-70)*binomial(n+4,6)/8.at n=7A144516
• Numbers with exactly 4 distinct odd prime divisors {3,5,7,11}.at n=13A147577
• a(n) = binomial(n + 8, 8)*7^n .at n=3A170932
• Number of length 5 nonnegative integer arrays starting and ending with 0 with adjacent elements unequal but differing by no more than n.at n=34A205342
• Number of n X 3 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 1 1 and 1 0 1 vertically.at n=10A207724
• E.g.f. satisfies: A(x) = x + A(x)^2 * cosh(A(x))^2 / 2.at n=6A214363
• Square root of the prime factor form (A276086) of the primorial base expansion, computed for such numbers for which it is a square.at n=45A328834
• Odd nonexponential abundant numbers: odd numbers k such that A160135(k) > k.at n=34A348605