In general there are 6^n different outcomes and n! different orderings, so a necessary condition is that 6^n is a multiple of n! That means any n ≥ 5 won’t work.
I don't know whether any of those can be non-transitive, though. I'd guess that it's sometimes possible but it's only a guess.
The dice they have for sale: https://mathsgear.co.uk/collections/dice/products/go-first-d...
(No affiliation, just the same site from the original article.)
The first was the non-transitive Grime dice, the second was the board game/Go First dice.
My last comment was only in regards to the second set of dice, that I thought they asked about.
For the Grimes dice, unless I've made an error, it would seem not. I get `(Sum {getSum = 1416},Sum {getSum = 2160},Sum {getSum = 2160},Sum {getSum = 1440},Sum {getSum = 600})` from the following program:
{-# LANGUAGE LambdaCase #-}
import Data.Monoid
oneIf x = Sum $ if x then 1 else 0
toRed = \case
1 -> 4
2 -> 4
3 -> 4
4 -> 4
5 -> 4
6 -> 9
toYellow = \case
1 -> 3
2 -> 3
3 -> 3
4 -> 3
5 -> 8
6 -> 8
toBlue = \case
1 -> 2
2 -> 2
3 -> 2
4 -> 7
5 -> 7
6 -> 7
toMagenta = \case
1 -> 1
2 -> 1
3 -> 6
4 -> 6
5 -> 6
6 -> 6
toOlive = \case
1 -> 0
2 -> 5
3 -> 5
4 -> 5
5 -> 5
6 -> 5
main = print $ mconcat $ do
red <- toRed <$> [1..6]
yellow <- toYellow <$> [1..6]
blue <- toBlue <$> [1..6]
magenta <- toMagenta <$> [1..6]
olive <- toOlive <$> [1..6]
let first = maximum [red, yellow, blue, magenta, olive]
[ ( oneIf $ first == red
, oneIf $ first == yellow
, oneIf $ first == blue
, oneIf $ first == magenta
, oneIf $ first == olive
) ]