|
Search: id:A073344
|
|
|
| A073344 |
|
Number of permutations p of (1,2,3,...,n) such that sum(k=1,n,p(k) reduced modulo k) =n. |
|
+0
1
|
| |
|
|
OFFSET
|
1,3
|
|
|
PROGRAM
|
(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: A150386 A150387 A150388 this_sequence A038119 A006986 A000903
Adjacent sequences: A073341 A073342 A073343 this_sequence A073345 A073346 A073347
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 23 2002
|
|
EXTENSIONS
|
a(10) from Mohammed Bouayoun (bouyao(AT)wanadoo.fr), Mar 14 2004
|
|
|
Search completed in 0.002 seconds
|
