32890

Appears in sequences

• Alkane (or paraffin) numbers l(8,n).at n=21A005995
• a(n) = 3*binomial(4*n-1, n-1)/(4*n-1).at n=6A006632
• a(n) = floor(C(n,6)/7).at n=26A011797
• Number of reversible strings with n-1 beads of 2 colors. 5 beads are black. String is not palindromic.at n=20A032092
• Number of necklaces with 7 black beads and n-7 white beads.at n=20A032192
• T(n,7), array T as in A051168; a count of Lyndon words; aperiodic necklaces with 7 black beads and n-7 white beads.at n=20A051172
• One half of binomial coefficients C(2*n-4,5).at n=10A053132
• a(n) = lcm(n, n+1, n+2, n+3, n+4) / 60.at n=21A067048
• Third level generalization of Catalan triangle (0th level is Pascal's triangle A007318; first level is Catalan triangle A009766; 2nd level is A069269).at n=42A069270
• Length of lists created by n substitutions k -> Range[k+1,1,-3] starting with {1}, counting down from k+1 to 1 step -3.at n=19A084080
• a(3n+k) = (k+1)*binomial(4n+k, n)/(3n+k+1), where k is n reduced mod 3.at n=20A124753
• Smallest heptagonal number with n distinct prime factors.at n=4A156238
• Triangle, read by rows, defined by: T(n,k) = 1/((k+1)n-1) binomial((k+1)n-1,n) for n,k>0.at n=38A162382
• G.f. A(x) satisfies: A(x*(1+x)^3) = 1 + x.at n=7A171790
• Number of distinct solutions of Sum_{i=1..6} x(2*i-1)*x(2*i) = 1 (mod n), with x() only in 1..n-1.at n=6A180788
• Number of ordered 10-tuples of distinct pairwise coprime positive integers with largest element n.at n=28A186981
• a(n) = lcm(n,n+1,n+2,n+3,n+4,n+5,n+6)/420.at n=20A189144
• Numbers k which use half of the ten digits such that they have at least one factorization k=p*q that uses remaining half of the digits that are not in k.at n=14A195814
• Number of n X 4 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 1 0 vertically.at n=10A208283
• Irregular triangle M_2(n,k) read by rows: number of maximum k-matchings in rooted plane trees of size n, 1<=k<=n/2, 2<=n.at n=48A219731