Little problem

[Mitch Harris]

On 8/8/07, David Wilson <davidwwilson at comcast.net> wrote:
>
> Not too deep but
>
> Show that the running sum of 1-A007814(n) never goes negative.

Not a (nice) proof like Warut's but...

sum(1-A007814(k),k=1,n)  =
n-sum(A007814(k),k=1,n)  =
n - A011371(n) =
A000120(n)


see:
http://www.research.att.com/~njas/sequences/A000120
http://www.research.att.com/~njas/sequences/A007814
http://www.research.att.com/~njas/sequences/A011371

-- 
Mitch Harris