[seqfan] (no subject)
mathar at strw.leidenuniv.nl
Sun Aug 2 13:03:39 CEST 2009
rh> From seqfan-bounces at list.seqfan.eu Sun Aug 2 12:43:27 2009
rh> Return-Path: <seqfan-bounces at list.seqfan.eu>
rh> From: rhhardin at att.net
rh> To: seqfan at list.seqfan.eu
rh> Date: Sun, 02 Aug 2009 10:15:13 +0000
rh> Subject: [seqfan] LRS formulas for n>=...?
rh> In for example the (one of many, new) three combinatoric sequences offset=1
rh> one can find the same empirical formula
rh> a(n)=4*a(n-1)-5*a(n-2)+2*a(n-3)+a(n-4)-2*a(n-5)+a(n-6) for n>=10
rh> Are such formulas of interest? I don't see any like them offhand in EIS.
The interest is in figuring out which other sequences have
the same combinatorial structure. To make such connection, one needs to gather
them at some common market place like
(for which I have some slightly updated version). The idea is that a look-up
with the (4,-5,2,1,-2,1) signature of the coefficients coeff(i) in front of
the a(n)=sum_i coeff(i)*a(n-i) leads to other sequences of the same family.
Another side effect is that one can write down the ordinary generating
function then (or its conjectured form if the recurrence is conjectural).
If the denominator polynomial then splits, one gets a very quick estimate to
whether the first differences, partial sums, Binomial transforms etc
are "simple." In the cases above, for example:
More information about the SeqFan