login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A247061 Dynamic Betting Game D(n,5,1). 9
1, 8, 16, 17, 24, 32, 33, 40, 48, 49, 56, 64, 65, 72, 80, 81, 88, 96, 97, 104, 112, 113, 120, 128, 129, 136, 144, 145, 152, 160, 161, 168, 176, 177, 184, 192, 193, 200, 208, 209, 216, 224, 225, 232, 240, 241, 248, 256 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Players A and B bet in a k-round game. Player A has an initial amount of money n. In each round, player A can wager an integer between 0 and what he has. Player A then gains or loses an amount equal to his wager depending on whether player B lets him win or lose. Player B tries to minimize player A's money at the end. The number of rounds player A can lose is r. a(n) is the maximum amount of money player A can have at the end of the game for k = 5 and r = 1.

REFERENCES

Charles Jwo-Yue Lien, Dynamic Betting Game, Southeast Asian Bulletin of Mathematics (to be published)

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..1000

Index entries for linear recurrences with constant coefficients, signature (1,0,1,-1).

FORMULA

With a(0)=0, a(n+1)-a(n) is a periodic function of n with value = 1, 7, 8.

a(n) = a(n-1) + a(n-3) - a(n-4). - Colin Barker, Sep 11 2014

G.f.: x*(8*x^2+7*x+1) / ((x-1)^2*(x^2+x+1)). - Colin Barker, Sep 11 2014

EXAMPLE

In the case of n=3: For the 1st round, player A bets 2. If A loses, A will end up with 16 by betting all he has for the last 4 rounds. If A wins, he has 5 and will end up with D(5,4,1)=16 per reference A247060. If A does not follow the proposed bet, he will have fewer than 16 at the end. So a(3) = 16.

PROG

(PARI) Vec(x*(8*x^2+7*x+1)/((x-1)^2*(x^2+x+1)) + O(x^100)) \\ Colin Barker, Sep 11 2014

(Haskell)

a247061 n = a247061_list !! (n-1)

a247061_list = [1, 8, 16, 17] ++ zipWith (+)

   (drop 3 a247061_list) (zipWith (-) (tail a247061_list) a247061_list)

-- Reinhard Zumkeller, Sep 19 2014

CROSSREFS

Cf. A247060, A247062, A247063, A247064, A247160, A247161.

Sequence in context: A296708 A297141 A004779 * A180860 A328189 A101766

Adjacent sequences:  A247058 A247059 A247060 * A247062 A247063 A247064

KEYWORD

nonn,easy

AUTHOR

Charles Jwo-Yue Lien, Sep 10 2014

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 17 14:19 EDT 2022. Contains 353746 sequences. (Running on oeis4.)