32637

Appears in sequences

• Number of partitions into non-integral powers.at n=27A000158
• Molien series for cyclic group of order 5.at n=42A008646
• a(n) = floor(C(n,4)/5).at n=46A011795
• a(n) = T(n,5), array T as in A051168; a count of Lyndon words; aperiodic necklaces with 5 black beads and n-5 white beads.at n=42A051170
• a(n)= n * reversal(n-1) * reversal(n+1).at n=32A160936
• Number of simple unlabeled graphs on n nodes with exactly 6 connected components that are trees or cycles.at n=14A215986
• a(n) = binomial(n+4,4)*gcd(n,5)/5.at n=42A234042
• a(n) = binomial(5n+6, 4)/5 for n >= 0.at n=8A238471
• Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 437", based on the 5-celled von Neumann neighborhood.at n=28A282216
• Expansion of Product_{k>=1} (1 - x^k)^k/(1 - x^(4*k))^(4*k).at n=36A285284
• Squarefree numbers k such that the sum of the distinct prime factors of k is twice the difference between the largest and the smallest prime factors of k.at n=32A324210
• Numbers which are the product of two S-primes (A057948) in exactly three ways.at n=35A343828
• Expansion of (1/x) * Series_Reversion( x*(1-x)^4/(1-x-x^4) ).at n=6A366090
• Expansion of 1/( (1-x) * (1-9*x)^3 )^(1/4).at n=5A383602