380548

Appears in sequences

• Number of 3-balanced strings of length n: let d(S)= #(1)'s in S - #(0)'s, then S is k-balanced if every substring T has -k<=d(T)<=k; here k=3.at n=24A027557
• Number of solutions to +- 1 +- 2 +- 3 +- 5 +- 7 +- ... +- prime(n-1) = 0 or 1.at n=27A367088
• Maximal coefficient of (1 + x) * (1 + x^2) * (1 + x^3) * (1 + x^5) * ... * (1 + x^prime(n-1)).at n=27A369765