[seqfan] Re: Jablan/Sazdanovic formula

[allouche at math.jussieu.fr]

Hi sequence A003437 is (seems to be) what Singmaster calls G(n)
see Page 2 of Singmaster's paper (Journal of Combinatorial Theory,
Series B, Volume 19, Issue 1, August 1975, Pages 1-4, which I accessed
freely from home). It is different from what he calls H(n) which is$
A003435. But I do not know what "2, 4, 37, 328, 3656, 47843" can be

best
jp




"Robert G. Wilson v" <rgwv at rgwv.com> a écrit :

> Et al,
>
> 	Even using Jean-Paul's correction, I am not able to reproduce the
> sequence.
>
> Mmca: f[n_] := Sum[(-1)^k*Binomial[n, k]*Floor[2 n/(2 n - k)]*2^k*(2 n -
> k)!/(2^n*n!), {k, 0, n}]; Array[f, 6, 2]
> They returns: {2, 4, 37, 328, 3656, 47843}
>
> Bob.
>
> -----Original Message-----
> From: SeqFan [mailto:seqfan-bounces at list.seqfan.eu] On Behalf Of Richard J.
> Mathar
> Sent: Wednesday, October 02, 2013 1:22 PM
> To: seqfan at seqfan.eu
> Subject: [seqfan] Jablan/Sazdanovic formula
>
> Can someone give a meaning to the formula on page 8 of in
> http://www.scipress.org/journals/forma/abstract/2201/22010005.html
> (related to A003437 as it seems)
> when the index reaches the upper limit k=n and a division by zero occurs in
> the square bracket?
>
> RJM
>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
>
>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
>