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.

Table of values

n a(n)
1 11
2 38
3 51
4 70
5 84
6 92
7 107
8 147
9 155
10 167
11 279
12 310
13 326
14 354
15 377
16 403
17 469
18 475
19 489
20 534
21 588
22 607
23 619
24 669
25 685
26 687
27 710
28 783
29 805
30 820
31 848
32 898
33 947
34 1010
35 1101
36 1207
37 1332
38 1467
39 1481
40 1520
41 1556
42 1578
43 1738
44 1744
45 1796
46 1802

List of values

[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]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.