cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A228650 Numbers k such that if an urn contains k balls, with at least one each of three colors, there exists a combination of the three colors such that it is equally probable for three balls randomly selected from the urn to all be either the same color or distinct colors.

Original entry on oeis.org

6, 8, 11, 12, 46, 57, 66, 120, 121, 145, 156, 162, 166, 217, 372, 386, 557, 596, 638, 750, 866, 1025, 1038, 1201, 1396, 1857, 2042, 2081, 2146, 2263, 2301, 2452, 2836, 2900, 2926, 2991, 3026, 3053, 3288, 3368, 3963, 3970, 4511, 4656, 5006, 5492, 5890, 5952
Offset: 1

Views

Author

William Rex Marshall, Aug 29 2013

Keywords

Comments

If the urn contains 596 balls, there exist two inequivalent combinations with the desired property, {86, 246, 264} and {126, 154, 316}.
The analogous sequence for two colors are the square numbers > 1 (A000290 with first two terms truncated).

Examples

			46 is a member of the sequence because if the urn contains 6 red, 18 green and 22 blue balls, then there are 6 * 18 * 22 = 2376 selections of three balls with distinct colors, and ((6 * 5 * 4) + (18 * 17 * 16) + (22 * 21 * 20)) / 3! = 2376 selections of three balls all the same color, and 6 + 18 + 22 = 46.
		

Crossrefs

Programs

  • Pascal
    program a228650;
    var
      p: array[1..6000] of int64;
      b1, b2, b3, k: int64;
      n, s: integer;
    begin
      k:=0;
      repeat
        inc(k);
        p[k] := (k * (k - 1) * (k - 2)) div 6;
      until k = 6000;
      n := 0; k := 2;
      repeat
        inc(k); s := 0;
        b1 := 0;
        repeat
          inc(b1);
          b2 := b1 - 1;
            b3 := k - (b1 + b2);
            repeat
            inc(b2); dec(b3);
            if (b3 >= b2) and (b1 * b2 * b3 = p[b1] + p[b2] + p[b3]) then
            begin
              inc(n); inc(s);
              writeln(n,' ',k);
            end;
          until (b3 <= b2) or (s > 0);
        until (3 * b1 >= k) or (s > 0);
      until k = 6000;
    end.

A228651 Numbers m such that if an urn contains m balls, with at least one each of c colors, for some c > 1 there exists a combination of c colors such that it is equally probable for c balls randomly selected from the urn to all be either the same color or distinct colors.

Original entry on oeis.org

4, 6, 8, 9, 10, 11, 12, 13, 14, 16, 17, 18, 20, 21, 22, 23, 24, 25, 26, 28, 29, 30, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76
Offset: 1

Views

Author

William Rex Marshall, Aug 29 2013

Keywords

Crossrefs

Programs

  • Pascal
    See the link section.

A228652 Numbers m such that if an urn contains m 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.

Original entry on oeis.org

1, 2, 3, 5, 7, 15, 19, 27, 31, 47
Offset: 1

Views

Author

William Rex Marshall, Aug 29 2013

Keywords

Comments

Is this sequence finite and complete?

Crossrefs

Programs

  • Pascal
    See the link section.
Showing 1-3 of 3 results.