cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A004205 Number of permutations of length n with spread 1.

This page as a plain text file.
%I A004205 M2753 #25 Dec 15 2022 02:51:14
%S A004205 1,3,8,25,108,735,4608,40824,362000,3628185,40766976,478988081,
%T A004205 6227101888,87146087625,1300561920000,20922788404479,355737629952000,
%U A004205 6402373698206889,121810906419200000,2432822933484213543,51090942172652090368,1124000727778962143055
%N A004205 Number of permutations of length n with spread 1.
%C A004205 The spread of a permutation p is Sum_{i=0..n-1} i*p(i), reduced modulo n. - _Rintaro Matsuo_, Dec 14 2022
%D A004205 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A004205 Rintaro Matsuo, <a href="/A004205/b004205.txt">Table of n, a(n) for n = 2..40</a>
%H A004205 R. L. Graham and D. H. Lehmer, <a href="https://doi.org/10.1017/S1446788700019339">On the Permanent of Schur's Matrix</a>, Jour. Australian Math. Soc. 21  no. 4 (series A) (1976), 487-497.
%H A004205 Rintaro Matsuo, <a href="https://github.com/windows-server-2003/OEIS_calculation/tree/master/contents/permutation_spread">Code used to calculate up to a(40)</a>
%K A004205 nonn
%O A004205 2,2
%A A004205 _N. J. A. Sloane_
%E A004205 More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), May 17 2007