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!)
A073343 Number of permutations p of (1,2,3,...,n) such that sum(k=1,n,gcd(k,p(k))) = sigma(n). 0

%I #14 Jan 09 2024 16:14:35

%S 1,1,1,6,33,75,877,2075,38692,239794,1250340,18495201,43023264,

%T 4554211553,70490483945,911526001064,182477118528,219638126087356,

%U 13070186026272,79249480638985626

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

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

%K more,nonn

%O 1,4

%A _Benoit Cloitre_, Aug 23 2002

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

%E a(11) from _Rick L. Shepherd_, Mar 15 2004

%E 2 more terms from _Ryan Propper_, Oct 25 2006

%E a(14)-a(20) from _Robert Gerbicz_, Nov 19 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 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)