login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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
0, 0, 2, 7, 23, 105, 386, 1674, 6121, 25072, 89070, 391317, 1432287, 5414201, 20125565, 80661495, 273257927, 1073041080, 3588277692, 13732078994, 49417761548, 176544997915, 551992576980, 2143844160219, 7367037483012 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Table of n, a(n) for n=1..25.

PROG

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

CROSSREFS

Sequence in context: A150387 A265797 A150388 * A038119 A006986 A000903

Adjacent sequences:  A073341 A073342 A073343 * A073345 A073346 A073347

KEYWORD

more,nonn

AUTHOR

Benoit Cloitre, Aug 23 2002

EXTENSIONS

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

a(11)-a(25) from Robert Gerbicz, Nov 22 2010

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 5 18:00 EDT 2021. Contains 346488 sequences. (Running on oeis4.)