39702

Appears in sequences

• Number of binary [ n,3 ] codes without 0 columns.at n=36A034344
• Construct sequences P,Q,R by the rules: Q = first differences of P, R = second differences of P, P starts with 1,3,9, Q starts with 2,6, R starts with 4; at each stage the smallest number not yet present in P,Q,R is appended to R. Sequence gives P.at n=55A225385
• Sum over all partitions lambda of n into 3 distinct parts of Product_{i:lambda} prime(i).at n=14A258358
• G.f. C(x) satisfies: C(x) = 1/((1-x*A(x))*(1-x*B(x)^2)) such that A(x) = 1/((1-x*B(x)^2)*(1-x*C(x)^3)) and B(x) = 1/((1-x*A(x))*(1-x*C(x)^3)) are the g.f.s of A341954 and A341955, respectively.at n=6A341956