|
Search: id:A093315
|
|
|
| A093315 |
|
Number of permutations s_1,s_2,...,s_n of 1,2,...,n with s_1 = 4 and such that for all j=1,2,...,n, s_j divides Sum_{i=1..j} s_i. |
|
+0
4
|
|
| 0, 0, 0, 1, 2, 2, 2, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 6, 8, 3, 14, 12, 18, 13, 14, 6, 26, 13, 198, 152, 220, 118, 1033, 807
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
The beginning elements of the permutation are 4, (either 1 or 2), ...
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: A049801 A049337 A076953 this_sequence A132784 A133873 A028953
Adjacent sequences: A093312 A093313 A093314 this_sequence A093316 A093317 A093318
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Matthijs Coster (matthijs(AT)coster.demon.nl), Apr 26 2004
|
|
|
Search completed in 0.002 seconds
|
