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.

A090863 Numbers n such that F(n+1)*F(n-1)*B(2n) is an integer, where F(k)=k-th Fibonacci number and B(2k)=2k-th Bernoulli number.

Table of values

n a(n)
1 1
2 7
3 13
4 17
5 19
6 31
7 37
8 43
9 47
10 49
11 59
12 61
13 67
14 71
15 73
16 79
17 91
18 97
19 101
20 103
21 107
22 109
23 121
24 127
25 133
26 137
27 139
28 143
29 149
30 151
31 157
32 161
33 163
34 167
35 169
36 181
37 193
38 197
39 199
40 211
41 217
42 223
43 227
44 229
45 241
46 247
47 257
48 259
49 263
50 269
51 271
52 277
53 283
54 289

List of values

[1, 7, 13, 17, 19, 31, 37, 43, 47, 49, 59, 61, 67, 71, 73, 79, 91, 97, 101, 103, 107, 109, 121, 127, 133, 137, 139, 143, 149, 151, 157, 161, 163, 167, 169, 181, 193, 197, 199, 211, 217, 223, 227, 229, 241, 247, 257, 259, 263, 269, 271, 277, 283, 289]