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.

A134019 Let P(A) be the power set of an n-element set A. Then a(n) = the number of pairs of elements {x,y} of P(A) for which either 0) x and y are intersecting but for which x is not a subset of y and y is not a subset of x, or 1) x = y.

Table of values

n a(n)
0 1
1 2
2 4
3 11
4 46
5 227
6 1114
7 5231
8 23566
9 102827
10 438274
11 1836551
12 7601686
13 31183427
14 127084234
15 515429471
16 2083077406
17 8396552027
18 33779262994
19 135696871991
20 544528258726
21 2183337968627
22 8749031918554
23 35043178292111
24 140313885993646
25 561679104393227
26 2247987182714914
27 8995761194057831

List of values

[1, 2, 4, 11, 46, 227, 1114, 5231, 23566, 102827, 438274, 1836551, 7601686, 31183427, 127084234, 515429471, 2083077406, 8396552027, 33779262994, 135696871991, 544528258726, 2183337968627, 8749031918554, 35043178292111, 140313885993646, 561679104393227, 2247987182714914, 8995761194057831]