#The list below are the first 12 terms in the sequence
#number of 3-deck sets of cards with n cards each that are "sucker's bets" i.e.
#deck A beats deck B, deck B beats deck C and deck C beats deck A. See the
#article "a Treatise on Sucker's bets"
#http://sites.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/suckerbets.html

[0, 0, 15, 39, 5196, 32115, 2093199, 19618353, 960165789, 11272949151, 479538890271, 6504453085104]