141778

Appears in sequences

• Fermat coefficients.at n=18A000971
• Number of dissections of a polygon: binomial(7n,n)/(6n+1).at n=6A002296
• Number of irreducible alternating Euler sums of depth 6 and weight 6+2n.at n=36A011796
• a(n) = floor(binomial(n,5)/6).at n=42A011843
• Number of necklaces with 6 black beads and n-6 white beads.at n=37A032191
• Schoenheim bound L_1(n,6,5).at n=36A036833
• Molien series for 3-D group X1.at n=37A037240
• a(n) = lcm(n, n+1, n+2, n+3, n+4) / 60.at n=37A067048
• Smith triangular numbers.at n=20A098840
• Triangular numbers that can be written as sum of two positive cubes.at n=9A113958
• a(n) = binomial(n*(n+1),n)/(n^2+1).at n=6A135862
• Generalized or s-Catalan numbers.at n=27A137211
• G.f. A(x) satisfies A(x) = 1 + x*A(x)^4*A(-x)^3.at n=12A143547
• a(n) = A185128(n) - A185129(n).at n=12A185253
• Maximum water retention of a number octagon of order n.at n=9A260302
• Triangular numbers which are products of five distinct primes.at n=34A357590
• Number of subsets of 6 integers between 1 and n such that their sum is 0 modulo n.at n=36A381289
• Number of subsets of 6 integers between 1 and n such that their sum is 1 modulo n.at n=36A381290
• a(0) = 1; a(n) = Sum_{k=0..floor((n-1)/6)} a(6*k) * a(n-1-6*k).at n=36A386380