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.

A160504 a(n) = number of ordered pairs (i,j) such that a(i)+a(j) a(1)=a(2)=1.

Table of values

n a(n)
1 1
2 1
3 1
4 3
5 6
6 6
7 6
8 15
9 15
10 18
11 18
12 18
13 21
14 21
15 21
16 21
17 27
18 27
19 29
20 38
21 38
22 47
23 59
24 59
25 72
26 72
27 72
28 84
29 90
30 90
31 96
32 96
33 97
34 109
35 109
36 112
37 123
38 123
39 123
40 141
41 141
42 143
43 153
44 153
45 161
46 167
47 167
48 170
49 181
50 181
51 186
52 186
53 186
54 193
55 194
56 194
57 202
58 202
59 202
60 210
61 216
62 216

List of values

[1, 1, 1, 3, 6, 6, 6, 15, 15, 18, 18, 18, 21, 21, 21, 21, 27, 27, 29, 38, 38, 47, 59, 59, 72, 72, 72, 84, 90, 90, 96, 96, 97, 109, 109, 112, 123, 123, 123, 141, 141, 143, 153, 153, 161, 167, 167, 170, 181, 181, 186, 186, 186, 193, 194, 194, 202, 202, 202, 210, 216, 216]

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

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