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.

A240560 a(n) = 2^n*E(n,1/2) + 2^(n+1)*E(n+1,0), where E(n,x) the Euler polynomials.

Table of values

n a(n)
0 0
1 0
2 1
3 0
4 -11
5 0
6 211
7 0
8 -6551
9 0
10 303271
11 0
12 -19665491
13 0
14 1704396331
15 0
16 -190473830831
17 0
18 26684005437391
19 0
20 -4581126864886571
21 0
22 946075012113714451
23 0
24 -231406946026650896711
25 0
26 66164529094650835995511
27 0
28 -21866924546405967976005251

List of values

[0, 0, 1, 0, -11, 0, 211, 0, -6551, 0, 303271, 0, -19665491, 0, 1704396331, 0, -190473830831, 0, 26684005437391, 0, -4581126864886571, 0, 946075012113714451, 0, -231406946026650896711, 0, 66164529094650835995511, 0, -21866924546405967976005251]