login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A112473 Number of partitions of n which represent first player winning Chomp positions with multiple winning moves. 2
0, 0, 0, 0, 0, 1, 2, 2, 4, 12, 9, 11, 22, 40, 52, 67, 95, 121, 150, 201, 275, 385, 443, 570, 752, 924, 1195, 1453, 1823, 2302, 2911, 3598, 4503, 5496, 6837, 8180, 10045, 12306, 15092, 18144 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,7

LINKS

Table of n, a(n) for n=1..40.

FORMULA

a(n) =A112471(n)-A112472(n)

EXAMPLE

a(9)=4 since positions with multiple winning moves are 4+3+2 to 4+3 or to 4+2+2, 4+3+1+1 to 4+3 or to 4+1+1+1 or to 3+3+1+1, 4+2+2+1 to 4+2+2 or to 4+1+1+1 or to 2+2+2+1 and 3+3+2+1 to 3+3+1+1 or to 2+2+2+1.

CROSSREFS

Sequence in context: A256890 A110476 A059343 * A134435 A136718 A112362

Adjacent sequences:  A112470 A112471 A112472 * A112474 A112475 A112476

KEYWORD

nonn

AUTHOR

Henry Bottomley, Sep 06 2005

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 7 07:15 EST 2016. Contains 278841 sequences.