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.

A353150 a(n) is the number of distinct pairs that can be made in exactly n iterations of either of the two maps (x, y) -> (x OR (2^y), 0) or (x, y) -> (x, y+1), starting from (0,0).

Table of values

n a(n)
0 1
1 2
2 4
3 7
4 12
5 18
6 28
7 40
8 58
9 80
10 110
11 147
12 198
13 259
14 338
15 434
16 558
17 706
18 892
19 1114
20 1389
21 1715
22 2115
23 2588
24 3163
25 3836
26 4647
27 5593
28 6725
29 8042
30 9600
31 11413
32 13551
33 16014
34 18907
35 22230
36 26112
37 30573
38 35750
39 41667
40 48514
41 56332
42 65326
43 75577
44 87343
45 100677

List of values

[1, 2, 4, 7, 12, 18, 28, 40, 58, 80, 110, 147, 198, 259, 338, 434, 558, 706, 892, 1114, 1389, 1715, 2115, 2588, 3163, 3836, 4647, 5593, 6725, 8042, 9600, 11413, 13551, 16014, 18907, 22230, 26112, 30573, 35750, 41667, 48514, 56332, 65326, 75577, 87343, 100677]