181695

Appears in sequences

• T(n,m) = Sum_{j=0..m} (-1)^(j + m)*(j + 1)^n*binomial(m, j) + Sum_{j=0..(n-m)} (-1)^(j - m + n )*(1 + j)^n*binomial(n-m, j).at n=37A156820
• T(n,m) = Sum_{j=0..m} (-1)^(j + m)*(j + 1)^n*binomial(m, j) + Sum_{j=0..(n-m)} (-1)^(j - m + n )*(1 + j)^n*binomial(n-m, j).at n=43A156820
• Number of binary words of length n with exactly 2 (possibly overlapping) occurrences of the subword given by the binary expansion of n.at n=21A236231
• Let {b(m)} be Recamán's sequence A005132, with the additional term b(-1):=0. Define a(n) to be the first index m where b(m-1)-m = -n, or -1 if b(m-1)-m never equals -n.at n=2A375118