@article {Reilly:1979:0022-2526:73,
title = "Counting Successions in Permutations",
journal = "Studies in Applied Mathematics",
parent_itemid = "infobike://bpl/sapm",
publishercode ="bp",
year = "1979",
volume = "61",
number = "1",
publication date ="1979-07-01T00:00:00",
pages = "73-81",
itemtype = "ARTICLE",
issn = "0022-2526",
eissn = "1467-9590",
url = "https://www.ingentaconnect.com/content/bpl/sapm/1979/00000061/00000001/art00004",
doi = "doi:10.1002/sapm197961173",
author = "Reilly, J. W. and Tanny, S. M.",
abstract = "Let = ((1), (2),...,(n)) be a permutation of the arbitrary nset S of postive integers. A succession in is any pair (i), (i + 1) with (i
+ 1) = (i) + 1, i = 1,2..., n 1. We show that the number of permutations of S which have precisely k successions depends only upon n, k and b, where b is the number of maximal disjoint intervals in the set [n
+ m]\S, and n + m is the largest element in S. We derive a linear recurrence relation for this number, which we call the succession number
(n, k; b), as well as an explicit formula in terms of derangement numbers.
The linear recurrence is used to derive the generating function for succession numbers. is also derived by formal power series methods from a wellknown generating function for succession in general integer sequences.",
}