> Proof of a Conjecture of Neil Sloane Concerning Claude Lenormand's ``Raboter" Operation (OEIS sequence A318921)
Proof of a Conjecture of Neil Sloane Concerning Claude Lenormand's ``Raboter" Operation (OEIS sequence A318921)

By Doron Zeilberger


.pdf   .ps   .tex  

(Exclusively published in the Personal Journal of Shalosh B. Ekhad and Doron Zeilberger)

Written: Nov. 16, 2018.


    Dedicated to Neil James Alexander Sloane (born Oct. X, MCMXXXIX) on his turning 1001111 years young (100101 days late)


Yesterday, Neil Sloane gave a great talk [ part 1  ,   part 2], where among many other fascinating results and open problems, he mentioned a conjecture that he made less than two months ago, concerning the ``planing" operation (raboter) introduced in 2004 by sequence enthusiast Claude Lenormand, and described in OEIS sequence A318921 . He also mentioned that he has no idea how hard it is to prove, and made a a `meta-conjecture' that it may be a `low-hanging fruit'. Here I show that both conjecture and meta-conjecture are true.
This article is accompanied by a short maple code RABOT.txt


Personal Journal of Shalosh B. Ekhad and Doron Zeilberger

Doron Zeilberger's Home Page