36165

Appears in sequences

• a(n)= 3*(n-1)*a(n-1) +(n-1)*a(n-2), with a(0)=1, a(1)=1.at n=6A108206
• The number of simple labeled graphs on n nodes such that i) all connected components have exactly one cycle, ii) all vertices have degree at most 3, iii) vertices of degree 3 are on a cycle.at n=7A201883
• a(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 2, 1] as of [1, 3, 1].at n=10A211297
• G.f.: exp( Sum_{n>=1} A064027(n)*x^n/n ), where A064027(n) = (-1)^n*Sum_{d|n}(-1)^d*d^2.at n=20A224364
• Least number such that the product of its digits in factorial base is n.at n=20A263130
• Expansion of Product_{k>=1} (1 - x^(2*k-1))^(2*k-1)/(1 - x^(2*k))^(2*k).at n=20A281683
• a(n) is the smallest positive integer which can be represented as the sum of distinct nonzero n-gonal pyramidal numbers in exactly n ways, or 0 if no such integer exists.at n=20A350210
• a(n) is the number of compositions of n into prime parts, with the 1st part equal to 2, the 2nd part less than or equal to 3, ..., and the k-th part less than or equal to prime(k), and so on.at n=33A359388