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.

A280867 Least k such that k is the sum of two totient numbers (A002202) in exactly n ways, or 0 if no such k exists.

Table of values

n a(n)
1 2
2 8
3 12
4 20
5 24
6 32
7 40
8 50
9 48
10 62
11 60
12 64
13 76
14 102
15 88
16 108
17 120
18 128
19 112
20 136
21 152
22 148
23 186
24 168
25 180
26 192
27 184
28 216
29 252
30 236
31 208
32 220
33 244
34 232
35 308
36 268
37 280
38 292
39 336
40 304
41 368
42 328
43 384
44 364
45 352
46 408
47 440
48 376
49 432
50 400
51 436
52 388
53 448
54 492
55 460
56 484
57 472
58 548

List of values

[2, 8, 12, 20, 24, 32, 40, 50, 48, 62, 60, 64, 76, 102, 88, 108, 120, 128, 112, 136, 152, 148, 186, 168, 180, 192, 184, 216, 252, 236, 208, 220, 244, 232, 308, 268, 280, 292, 336, 304, 368, 328, 384, 364, 352, 408, 440, 376, 432, 400, 436, 388, 448, 492, 460, 484, 472, 548]

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

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