14938

Properties

Appears in sequences

• Number of n-bead bracelets (turnover necklaces) of two colors with 10 red beads and n-10 black beads.at n=12A005515
• Number of n-bead bracelets (turnover necklaces) with 12 red beads.at n=10A005516
• Number of terms in 6th derivative of a function composed with itself n times.at n=13A022816
• a(n) = T(2n, n-2), T given by A026769.at n=5A026772
• a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 3, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 3.at n=15A049924
• Number of 5-tuples (v1,v2,v3,v4,v5) of nonnegative integers less than n such that v1 <= v4, v1 <= v5, v2 <= v4, v2 <= v5 and v3 <= v4.at n=9A085463
• Number of productions of a certain "divide-and-conquer" context-free grammar in Chomsky normal form that generates all permutations of n symbols.at n=10A092285
• Expansion of x/((1-x-x^3)*(1-x)^8).at n=9A144902
• Coefficient of x^n in expansion of x/((1-x-x^3)*(1-x)^(n-1)), also diagonal of A144903.at n=9A144904
• a(n) = 10*n^2 - 7*n + 1.at n=39A158186
• The number of trisubstitution products with composition C_n H_(2n-1) X_2 Y.at n=19A159940
• Right edge of triangular table A138612.at n=33A166019
• Let y = y(u,v) be implicitly defined by g(u,v,y(u,v)) = 0. Read as a triangle by rows k = 1,2,..., the sequence represents the number of terms a(i,k-i) in the expansion of the partial derivatives d^k y/du^i dv^{k-i} in terms of partial derivatives of g.at n=47A172004
• Let y = y(u,v) be implicitly defined by g(u,v,y(u,v)) = 0. Read as a triangle by rows k = 1,2,..., the sequence represents the number of terms a(i,k-i) in the expansion of the partial derivatives d^k y/du^i dv^{k-i} in terms of partial derivatives of g.at n=50A172004
• Number of five-prime Carmichael numbers less than 10^n.at n=14A174613
• G.f.: A(x) = Product_{n>=1} 1/(1 - G_n(x)^n) where G(x) = x+x^2 and G_n(x) denotes the n-th iteration of G(x): G_n(x) = G_{n-1}(G(x)) with G_0(x)=x.at n=8A182968
• Triangle read by rows: T(n,k) is the number of weighted lattice paths in B(n) having k ascents. The members of B(n) are paths of weight n that start at (0,0), end on but never go below the horizontal axis, and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps. An ascent is a maximal sequence of consecutive (1,1)-steps.at n=61A246186
• a(n) = n*(6*n^2 - 8*n + 3).at n=14A272378
• Least integer k such that prime(k+1) - prime(k) = 2 and prime(k+2) - prime(k+1) = 2n, or 0 if no such k exists.at n=22A280941
• The number of partitions of n which represent Chomp positions with Sprague-Grundy value 5.at n=54A284692