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.

A071853 Numbers n such that for any x, C(2x,x) never has n distinct prime factors.

Original entry on oeis.org

11, 38, 51, 70, 84, 92, 107, 147, 155, 167, 279, 310, 326, 354, 377, 403, 469, 475, 489, 534, 588, 607, 619, 669, 685, 687, 710, 783, 805, 820, 848, 898, 947, 1010, 1101, 1207, 1332, 1467, 1481, 1520, 1556, 1578, 1738, 1744, 1796, 1802
Offset: 1

Views

Author

Benoit Cloitre, Jun 09 2002

Keywords

Formula

n such that Card ( x : A067434(x) = n ) = 0

Extensions

More terms from Naohiro Nomoto, Jun 16 2002