login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A182240 Number of inequivalent ways to select n cards in the game of SET. 0
1, 1, 1, 2, 3, 6, 15, 34, 105, 384, 1658, 8135, 41407, 205211, 963708, 4231059, 17295730, 65807588, 233346408, 772518828, 2392611091, 6946116261, 18937468347, 48568206996 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

The game of SET (see the reference) is played with 81 cards, so this sequence is finite, with 82 terms.

LINKS

Table of n, a(n) for n=0..23.

Ben Coleman and Kevin Hartshorn, Game, Set, Math, Math. Mag. 85(2012), p. 83-96.

CROSSREFS

Sequence in context: A158027 A100249 A138477 * A052102 A053561 A237585

Adjacent sequences:  A182237 A182238 A182239 * A182241 A182242 A182243

KEYWORD

nonn,fini

AUTHOR

John W. Layman, Apr 20 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 17 02:22 EST 2020. Contains 331976 sequences. (Running on oeis4.)