|
%I #11 Jul 12 2014 09:45:53
%S 1,1,1,2,3,6,15,34,105,384,1658,8135,41407,205211,963708,4231059,
%T 17295730,65807588,233346408,772518828,2392611091,6946116261,
%U 18937468347,48568206996
%N Number of inequivalent ways to select n cards in the game of SET.
%C The game of SET (see the reference) is played with 81 cards, so this sequence is finite, with 82 terms.
%H Ben Coleman and Kevin Hartshorn, <a href="http://www.jstor.org/stable/10.4169/math.mag.85.2.083">Game, Set, Math</a>, Math. Mag. 85(2012), p. 83-96.
%K nonn,fini
%O 0,4
%A _John W. Layman_, Apr 20 2012
|
