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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A228652 Numbers n such that if an urn contains n balls, with at least one each of c colors, there is no c > 1 for which a combination of c colors exists such that it is equally probable for c balls randomly selected from the urn to all be either the same color or distinct colors. 4
1, 2, 3, 5, 7, 15, 19, 27, 31, 47 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Is this sequence finite and complete?

LINKS

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

William Rex Marshall, Pascal program for this sequence.

PROG

(PASCAL) See the link section.

CROSSREFS

Cf. A228650, A228651, A228653.

Sequence in context: A316475 A303875 A331037 * A157833 A175758 A151531

Adjacent sequences:  A228649 A228650 A228651 * A228653 A228654 A228655

KEYWORD

nonn

AUTHOR

William Rex Marshall, Aug 29 2013

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 January 19 20:41 EST 2020. Contains 331066 sequences. (Running on oeis4.)