[seqfan] Re: Sequence from buggy polyomino counter

Peter Munn techsubs at pearceneptune.co.uk
Mon Jan 7 18:41:36 CET 2019


On Fri, December 21, 2018 12:20 pm, Alex Meiburg wrote:
>
> In any case, trying to find out what your code is actually counting would
> be a lot of fun -- and I'd bet good odds that it's counting *something*!

Trees labelled 1..n embedded in an oriented square grid, provided that for
1 <= k <= n the nodes labelled 1..k with their mutually connecting edges
also form a tree?

Best Regards,

Peter

> On Fri, Dec 21, 2018 at 3:39 AM Hugo Pfoertner <yae9911 at gmail.com> wrote:
>
>> Not very serious: My guess: 8*A279651 <http://oeis.org/A279651>(5) =
>> 8*2232
>> = 17856
>>
>> Hugo
>>
>> On Fri, Dec 21, 2018 at 5:20 AM Allan Wechsler <acwacw at gmail.com> wrote:
>>
>> > I was trying to sharpen my Haskell skills by writing a program to
>> compute
>> > A048664, the number of different polyominos including the origin cell,
>> > where rotations, translations, and reflections are considered
>> distinct.
>> >
>> > I wrote the code, compiled it a couple of times to get the syntax
>> errors
>> > out, and then tried it out. It has a bug. Instead of 1, 4, 18, 76,
>> 315,
>> it
>> > produces 1, 4, 24, 192, 1856.
>> >
>> > My first impulse was: fix the darned bug! But then I thought: wait a
>> > second, maybe OEIS can help me find the bug. So I searched for the
>> programs
>> > buggy output sequence.
>> >
>> > It's not in OEIS. Question: how much effort should I put into
>> analyzing
>> the
>> > program's actual behavior? It might be doing something interesting
>> that
>> is
>> > worth including. If anybody wants to try guessing, what's the next
>> element?
>> >
>> > --
>> > Seqfan Mailing list - http://list.seqfan.eu/
>> >
>>
>> --
>> Seqfan Mailing list - http://list.seqfan.eu/
>>
>
> --
> Seqfan Mailing list - http://list.seqfan.eu/
>





More information about the SeqFan mailing list