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.

A261682 a(n) = 2^n+(1+(n mod 2)/2)*C(n+1,floor((n+(n mod 2))/2))-1.

Table of values

n a(n)
0 1
1 4
2 6
3 16
4 25
5 61
6 98
7 232
8 381
9 889
10 1485
11 3433
12 5811
13 13339
14 22818
15 52072
16 89845
17 204001
18 354521
19 801421
20 1401291
21 3155299
22 5546381
23 12444841
24 21977515
25 49155331
26 87167163
27 194392627
28 345994215
29 769547191
30 1374282018
31 3049104232
32 5461770405
33 12090343921

List of values

[1, 4, 6, 16, 25, 61, 98, 232, 381, 889, 1485, 3433, 5811, 13339, 22818, 52072, 89845, 204001, 354521, 801421, 1401291, 3155299, 5546381, 12444841, 21977515, 49155331, 87167163, 194392627, 345994215, 769547191, 1374282018, 3049104232, 5461770405, 12090343921]