[seqfan] Re: parity of binomials and some carryless products A175669 - A175672
antti.karttunen at gmail.com
Thu Aug 12 19:02:12 CEST 2010
On Wed, Aug 11, 2010 at 9:54 PM, <seqfan-request at list.seqfan.eu> wrote:
> Message: 14
> Date: Wed, 11 Aug 2010 20:25:16 +0200
> From: Richard Mathar <mathar at strw.leidenuniv.nl>
> Subject: [seqfan] parity of binomials and some carryless products,
> A175669 - A175672
> To: seqfan at seqfan.eu
> Message-ID: <201008111825.o7BIPGvG019644 at krypton.strw.leidenuniv.nl>
> Content-Type: text/plain; charset=us-ascii
> These 8 sequences appear highly correlated in pairs:
> They all deal with parities of binomials C(k*n,n) on one hand
> and the Finnish way of multiplication in GF(2)[x] on the other.
The starving bears ate our carry-bits, so we have to do without...
> It would
> be nice to have some explanations on the mutual correlations
> and --from the purely administrative point of view-- comments inserted
> when they start to differ.
Also, regarding the recent speculation about running all new
submissions through Superseeker:
it would be nice even if it did start with just one transformation:
to detect the obvious duplicate-candidates!
BTW, I check every sequence I submit with the python script available from here:
it creates a similarly named local HTML-file, where the %S-lines
(after two initial terms)
are search-links to OEIS. (Actually the subsequence to be searched
from OEIS should
be even shorter.)
My hunch is that it shouldn't be too hard to prove that the sequences
are identical. If one considers the parity of binomial coefficient of C(kn,n),
it's the same thing as a bit n on row kn in
(and each row is obtained from the previous row with a simple shifted
xor, see http://oeis.org/classic/A001317 )
But sorry, too tired to do it by myself now.
> Richard Mathar
More information about the SeqFan