On the Number of Permutations on n Objects with Greatest Cycle Length k

Advances in Applied Mathematics

Volumn 20, Issue 1, 1998, Pages 98-107

  Golomb, Solomon W ^a   Gaal, Peter ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040635301     PISSN: 01968858     EISSN: None     Source Type: Journal    
DOI: 10.1006/aama.1997.0567     Document Type: Article

References (6)

1. S. W. Golomb, Cycles from Nonlinear Shift Registers, August 1959.
2. Golomb S. W. Random Permutations. Bull. Amer. Math. Soc. 70:Nov. 1964;747.
3. Golomb S. W. Shift Register Sequences. 1967;Holden-Day, San Francisco.
4. Golomb S. W. Shift Register Sequences. 1982;Aegean Park Press, Laguna Hills.
5. Knuth D. E. The Art of Computer Programming. Seminumerical Algorithms. 1969;Addison-Wesley, Reading. p. 8 and 454.
6. Dickman K. On the frequency of numbers containing prime factors of a certain relative magnitude. Ark. Mat. Astron. Fys. A. 22:1930;1-14.