Request for another 5-10 terms as well as an error in entry A259864

[Jason Hans]

Terms 31 & 32 are terms 29 and 30 repeated 

If a few more terms can be found that'd be really cool also

[Sean A. Irvine]

Hi Jason,

Thanks for pointing out this duplication of terms problem. I have removed the duplicates.

It would be worth checking if the paper mentioned in McKeon's letter to Neil ever appeared.

Sean.

On Fri, 3 Jul 2026 at 09:05, Jason Hans <rayba...@gmail.com> wrote:

Terms 31 & 32 are terms 29 and 30 repeated 

If a few more terms can be found that'd be really cool also

--
You received this message because you are subscribed to the Google Groups "SeqFan" group.
To unsubscribe from this group and stop receiving emails from it, send an email to seqfan+un...@googlegroups.com.
To view this discussion visit https://groups.google.com/d/msgid/seqfan/CAK2gTfcORLEOHbh%2B04OSo2T4NhCU5Hgfm2Vr4oKQ-DT8ZM5%2BLQ%40mail.gmail.com.

[Gareth McCaughan]

On 02/07/2026 22:16, Sean A. Irvine wrote:

Hi Jason,

Thanks for pointing out this duplication of terms problem. I have removed the duplicates.

It would be worth checking if the paper mentioned in McKeon's letter to Neil ever appeared.

It might be this: https://combinatorialpress.com/article/ars/Volume%20096/volume-96-paper-19.pdf

(This describes how to enumerate highly irregular trees of order n and degree <= d, and says that if you take d >= floor(log_2 n) then this is the same as enumerating _all_ highly irregular trees of order n.)

-- 
g