Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #15 Jan 12 2022 21:36:39
%S 1,1,2,11,76,600
%N Number of hitomezashi loops of width 2n+1 and height 2n+1.
%C The Defant--Kravitz paper proves that every hitomezashi loop has odd width and odd height.
%H Colin Defant and Noah Kravitz, <a href="https://arxiv.org/abs/2201.03461">Loops and regions in hitomezashi patterns</a>, arXiv:2201.03461 [math.CO], 2022.
%F a(n) = A350681(2n,n).
%Y Cf. A121790, A350681.
%K nonn,more
%O 0,3
%A _Colin Defant_, Jan 11 2022