login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A287222 Number of 3-time self-crossing partitions on n nodes. 0
0, 0, 0, 0, 2, 16, 164, 944, 4386, 22240, 83066, 398132 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,5

COMMENTS

The meandric numbers A005316 are the numbers of paths which cross themselves 0 times.

This sequence is the number of paths that must cross themselves exactly 3 times.

LINKS

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

B. W. J. Irwin, On the number of k-crossing partitions

EXAMPLE

a(4) = 2, this is from the partitions (2,4,1,3) and (3,4,1,2).

CROSSREFS

Cf. A005316, A287220, A287221.

Sequence in context: A226012 A011552 A326362 * A216598 A219397 A275912

Adjacent sequences:  A287219 A287220 A287221 * A287223 A287224 A287225

KEYWORD

nonn,more

AUTHOR

Benedict W. J. Irwin, May 22 2017

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 31 19:37 EDT 2020. Contains 333151 sequences. (Running on oeis4.)