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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A073344 Number of permutations p of (1,2,3,...,n) such that sum(k=1,n,p(k) reduced modulo k) =n. 0

%I #9 Mar 30 2012 18:58:21

%S 0,0,2,7,23,105,386,1674,6121,25072,89070,391317,1432287,5414201,

%T 20125565,80661495,273257927,1073041080,3588277692,13732078994,

%U 49417761548,176544997915,551992576980,2143844160219,7367037483012

%N Number of permutations p of (1,2,3,...,n) such that sum(k=1,n,p(k) reduced modulo k) =n.

%o (PARI) a(n)=sum(k=1,n!,if(sum(i=1,n,i%component(numtoperm(n,k),i))-n,0,1))

%K more,nonn

%O 1,3

%A _Benoit Cloitre_, Aug 23 2002

%E a(10) from Mohammed Bouayoun (bouyao(AT)wanadoo.fr), Mar 14 2004

%E a(11)-a(25) from _Robert Gerbicz_, Nov 22 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 12:33 EDT 2024. Contains 371969 sequences. (Running on oeis4.)