[QUOTE 2271955, member: 9609"]No it wasn't, It was as correct as yours ![/quote]
No. To a mathematician, (n+1) / 2 x n is the same as (n+1)/2n. You need to multiply by n, not divide.
[QUOTE 2271962, member: 9609"]Many thanks for that, quite a simple little equation.
Could I ask you to explain how you created it?[/quote]
It feels combinatorial. I suspect the general answer is
(n+1)! / (n-m)! . m!
It's been a very very long while since I did combinatorics, but it's something like the number of ways of selecting m things from n. You're asking for the number of ways of selecting 3 from n. The proof will be by induction - prove true for n=1 and that if true for n, also true for n+1.