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!)
A298783 Number of exceptional cases in an analysis of the muffin problem with n students. 0
0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 3, 2, 3, 3, 3, 3, 4, 3, 4, 4, 4, 4, 5, 7, 5, 5, 5, 6, 6, 5, 6, 7, 6, 6, 7, 7, 7, 7, 7, 8, 10, 7, 8, 9, 8, 8, 9, 9, 10, 9, 9, 10, 10, 9 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,11

LINKS

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

Guangiqi Cui et al., The Muffin Problem, arXiv:1709.02452 [math.CO], 2017. See Appendix G.

CROSSREFS

Sequence in context: A261348 A320536 A338336 * A053280 A289122 A025832

Adjacent sequences:  A298780 A298781 A298782 * A298784 A298785 A298786

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane, Jan 26 2018

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 June 24 05:58 EDT 2021. Contains 345416 sequences. (Running on oeis4.)