[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A167179
The number of additional armies one receives in Parker Brothers' (now part of Hasbro) game of Risk for turning in the n-th set of three different or alike cards.
0
4, 6, 8, 10, 12, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 100, 105, 110, 115, 120, 125, 130, 135, 140, 145, 150, 155, 160, 165, 170, 175, 180, 185, 190, 195, 200, 205, 210, 215, 220, 225, 230, 235, 240, 245, 250, 255, 260, 265, 270, 275
OFFSET
1,1
COMMENTS
Although this sequence is theoretically infinite, in actual practice, terms greater than a(15) are rarely reached.
FORMULA
a(n) = 2*(n+1) for n<=5, otherwise a(n) = 5*(n-3).
MATHEMATICA
LinearRecurrence[{2, -1}, {4, 6, 8, 10, 12, 15, 20}, 50] (* G. C. Greubel, Jun 04 2016; amended by Georg Fischer, Apr 03 2019 *)
PROG
(PARI) a(n)=if(n>5, 5*n-15, 2*n+2) \\ Charles R Greathouse IV, Aug 21 2015
CROSSREFS
Sequence in context: A231571 A286043 A310658 * A193167 A020645 A053226
KEYWORD
nonn,easy,less
AUTHOR
Michael Turniansky, Oct 29 2009
EXTENSIONS
a(13) = 50 inserted by Georg Fischer, Apr 08 2019
STATUS
approved