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.

A347425 a(n) = Bernoulli(2*n) * (2*n+1)! if 2*n+1 is a prime, otherwise a(n) = Bernoulli(2*n) * (2*n)!.

Table of values

n a(n)
0 1
1 1
2 -4
3 120
4 -1344
5 3024000
6 -1576143360
7 101708006400
8 -2522591034163200
9 6686974460694528000
10 -1287307431968882688000
11 160078872315904478576640000
12 -53718579665963356985229312000
13 574898901006059006921736192000000
14 -241364461951740682229320388129587200000

List of values

[1, 1, -4, 120, -1344, 3024000, -1576143360, 101708006400, -2522591034163200, 6686974460694528000, -1287307431968882688000, 160078872315904478576640000, -53718579665963356985229312000, 574898901006059006921736192000000, -241364461951740682229320388129587200000]