107008

Appears in sequences

• Least positive unitary linear combination of distinct numbers in row n of Pascal's triangle; i.e., least positive sum of form d(0)C(n-1,0) + d(1)C(n-1,1) + ...+ d(m)C(n-1,m), d(i)=+-1, m = floor((n+1)/2).at n=30A004795
• Numbers that can be written as k/d(k) in four or more ways, where d(k) = number of divisors of k.at n=10A051346
• Duplicate of A051346.at n=10A051520
• a(n) = S1(n,1), where S1(n, t) = Sum_{k=0..n} (k^t * Sum_{j=0..k} binomial(n,j)).at n=11A089658
• a(n) = 2*a(n-1) + 4*a(n-2) - 2*a(n-3) with initial terms 1, 4, 13.at n=10A091141
• Minimal covering numbers.at n=46A160559
• Expansion of 1/((1-x)^2*(1-x^2)^3*(1-x^3)^2*(1-x^4)).at n=31A210068
• G.f. for Ehrhart quasi-polynomials for hyperplane arrangements of type E_7.at n=49A210633
• Numbers n such that n = k/d(k) has exactly 4 solutions, where d(k) = number of divisors of k.at n=8A217125
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 390", based on the 5-celled von Neumann neighborhood.at n=16A287982
• G.f. satisfies A(x) = 1 + 2*x + 2*x^2*A(x)^2.at n=12A367071