A004205 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A004205

Number of permutations of length n with spread 1.
(Formerly M2753)

1, 3, 8, 25, 108, 735, 4608, 40824, 362000, 3628185, 40766976, 478988081, 6227101888, 87146087625, 1300561920000, 20922788404479, 355737629952000, 6402373698206889, 121810906419200000, 2432822933484213543, 51090942172652090368, 1124000727778962143055

(list; graph; refs; listen; history; text; internal format)

OFFSET

2,2

COMMENTS

The spread of a permutation p is Sum_{i=0..n-1} i*p(i), reduced modulo n. - Rintaro Matsuo, Dec 14 2022

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Rintaro Matsuo, Table of n, a(n) for n = 2..40

R. L. Graham and D. H. Lehmer, On the Permanent of Schur's Matrix, Jour. Australian Math. Soc. 21 no. 4 (series A) (1976), 487-497.

Rintaro Matsuo, Code used to calculate up to a(40)

CROSSREFS