Create a recursive function using Haskell that takes a list and a number that represents the count in order to return every nth value found in that list. It should not rely on any imported functions and if necessary should involve a helper function.

Examples:

getNth "aAbBcCdD" 2 would return "ABCD".

or

getNth [1,2,3,4,5,6,7,8,9,10,11,12,13, 14, 15, 16] 5

would return [5,10,15].