33966

Appears in sequences

• Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,7.at n=32A064240
• Consider the smallest denominator q such that the Sylvester expansion of n/q has n terms. Here q has the form q = k*n+1 and we set a(n) = k.at n=22A098853
• Number of nondecreasing sequences of n 1..7 integers with no element dividing the sequence sum.at n=23A212867
• Arises from color-symmetrized counting of tensor invariants.at n=8A232217
• Number of not unique partition coefficients of n.at n=41A309897
• Number of chiral pairs of color loops of length n with integer entries that cover an initial interval of positive integers.at n=7A326895
• Number of colored integer partitions of n using all colors of a 2-set such that parts i have distinct color patterns in arbitrary order and each pattern for a part i has i colors in (weakly) increasing order.at n=16A327890
• Number of ways to write n as an ordered sum of 5 squarefree numbers.at n=45A341065