|
Search: id:A093314
|
|
|
| A093314 |
|
Number of permutations s_1,s_2,...,s_n of 1,2,...,n with s_1 = 3 and such that for all j=1,2,...,n, s_j divides Sum_{i=1..j} s_i. |
|
+0
3
|
|
| 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 12, 20, 20, 1, 163, 55
(list; graph; listen)
|
|
|
OFFSET
|
1,35
|
|
|
COMMENT
|
The beginning elements of the permutation are 3,1,(either 2 or 4),...
The total number of permutations with this property is given in A067957.
|
|
REFERENCES
|
Matthijs Coster, Problem 2001/3-A of the Universitaire Wiskunde Competitie, Nieuw Arch. Wisk. 5/3 (2002), 92-94.
|
|
LINKS
|
Matthijs Coster, Sequences
|
|
CROSSREFS
|
Cf. A067957, A093313, A093315.
Sequence in context: A119382 A166671 A104198 this_sequence A138166 A046418 A038528
Adjacent sequences: A093311 A093312 A093313 this_sequence A093315 A093316 A093317
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Matthijs Coster (matthijs(AT)coster.demon.nl), Apr 26 2004
|
|
|
Search completed in 0.002 seconds
|
