Golf schedule variation

[Trio]

Hello to everybody!
I'm facing a combinatorial problem that looks like the golf schedule. The original problem said that the goal is to select, for example, the threesomes so that each person only golfs with the same person once. Instead I would find the threesomes so that each person only golfs with the same other members of the team once. In practice for 6 members I would like to arrange 20 terns:
123, 124, 125, 126, 134, 135, 136, 145, 146, 156, 234, 235, 236, 245, 246, 256, 345, 346, 356, 456.
in a 10 [20/(6/3)] days calendar.
Do you know if there is an algorithm that solves this problem for N members?
Thanks in advance!

[Ian Wakeling]

Just peel off the first and last from your list.

123 & 456

then keep repeating:

124 & 356,  125 & 346 etc....

[Trio]

Thanks Ian for your prompt answer.
Your method works fine for N=6 members but is not longer valid for any other multiple of 3...