login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A350681 Triangle read by rows. T(n,k) is the number of hitomezashi loops of width 2(n-k)+1 and height 2k+1 for 0 <= k <= n. 1
1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 2, 1, 0, 0, 1, 4, 4, 1, 0, 0, 1, 8, 11, 8, 1, 0, 0, 1, 16, 27, 27, 16, 1, 0, 0, 1, 32, 64, 76, 64, 32, 1, 0 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

0,13

COMMENTS

The Defant--Kravitz paper proves that every hitomezashi loop has odd width and odd height.

LINKS

Table of n, a(n) for n=0..44.

Colin Defant and Noah Kravitz, Loops and Regions in Hitomezashi Patterns, arXiv:2201.03461 [math.CO], 2022.

FORMULA

T(n,k) = T(n,n-k).

EXAMPLE

Triangle T(n,k) begins:

  1;

  0, 0;

  0, 1,  0;

  0, 1,  1,  0;

  0, 1,  2,  1,  0;

  0, 1,  4,  4,  1,  0;

  0, 1,  8, 11,  8,  1,  0;

  0, 1, 16, 27, 27, 16,  1, 0;

  0, 1, 32, 64, 76, 64, 32, 1, 0;

  ...

CROSSREFS

T(2n,n) gives: A350680.

Sequence in context: A168312 A076837 A055363 * A110855 A054673 A155103

Adjacent sequences:  A350678 A350679 A350680 * A350682 A350683 A350684

KEYWORD

nonn,tabl,more

AUTHOR

Colin Defant, Jan 11 2022

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 23 23:53 EDT 2022. Contains 353993 sequences. (Running on oeis4.)