Sequence A112088 without example

[Graeme McRae]

I must have Fibonacci on the brain.  No need to single out a(2) here.  I'll 
send this in:

a(1)=2; a(n)=floor((5+sum(a(1):a(n-1)))/2)

----- Original Message ----- 
From: "Graeme McRae" <g_m at mcraefamily.com>
To: "seqfan" <seqfan at ext.jussieu.fr>
Sent: Friday, June 09, 2006 8:43 PM
Subject: Re: Sequence A112088 without example


> The similarity of A112088 (the smallest number of people at the start for 
> which the last victim is killed in round n+1) to A5428 (the smallest 
> number of people at the start for which the last survivor is met in round 
> n) suggests the simple formula for A112088:
>
> a(1)=2; a(2)=3; a(n)=floor((5+sum(a(1):a(n-1)))/2)
>
>
> ----- Original Message ----- 
> From: "Max" <maxale at gmail.com>
> To: "Hugo Pfoertner" <all at abouthugo.de>
> Cc: <seqfan at ext.jussieu.fr>
> Sent: Friday, June 09, 2006 8:08 PM
> Subject: Re: Sequence A112088 without example
>> Ops! I've tried to recompute that sequence myself and I've got
>> sequence A005428(n+1) which is different from Rainer's one.
>>
>
>