44961

Appears in sequences

• Pascal-(1,7,1) array.at n=49A081582
• Pascal-(1,7,1) array.at n=50A081582
• Number of representations of n as a sum of products of pairs of positive integers, considered to be equivalent when terms or factors are reordered.at n=33A182269
• Number of 0..n arrays x(0..9) of 10 elements with zero 5th differences.at n=45A200446
• G.f. satisfies A(x) = exp( Sum_{k>=1} (-1)^(k+1) * (2^k + A(x^k)) * x^k/k ).at n=10A363542
• Place n equally spaced points around the circumference of a circle and then, for each pair of points, draw two distinct circles, whose radii are the same as the first circle, such that both points lie on their circumferences. The sequence gives the total number of (curved) edges formed.at n=20A371375