OFFSET
1,3
COMMENTS
Pattern counting considers only one revolution otherwise every sufficiently long circular permutation, with enough revolutions allowed, contains every pattern.
Each column k is divisible by k, because as we count linear patterns inside a circular permutation, we may obtain all circular shifts of the subset which represents a particular pattern.
EXAMPLE
The triangle begins:
n| k: 1| 2| 3| 4| 5| 6| 7| 8| 9
=========================================
[1] 1
[2] 1, 2
[3] 1, 2, 3
[4] 1, 2, 6, 4
[5] 1, 2, 6, 16, 5
[6] 1, 2, 6, 20, 25, 6
[7] 1, 2, 6, 24, 60, 36, 7
[8] 1, 2, 6, 24, 85, 126, 49, 8
[9] 1, 2, 6, 24, 100, 222, 196, 64, 9
.
Row 5 of A194832 is [3, 1, 4, 2, 5].
T(5, 4) = 16 because we will find these 16 distinct patterns of length 4:
[3, 1, 4, 2] [1, 4, 2, 3] [4, 2, 3, 1] [2, 3, 1, 4]
These are rotations of the ordering [1, 4, 2, 3].
[1, 4, 2, 5] [4, 2, 5, 1] [2, 5, 1, 4] [5, 1, 4, 2]
These are rotations of the ordering [1, 3, 2, 4].
[2, 5, 3, 1] [5, 3, 1, 2] [3, 1, 2, 5] [1, 2, 5, 3]
These are rotations of the ordering [1, 2, 4, 3].
[5, 3, 1, 4] [3, 1, 4, 5] [1, 4, 5, 3] [4, 5, 3, 1]
These are rotations of the ordering [1, 3, 4, 2].
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Thomas Scheuerle, Jul 08 2024
STATUS
approved