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.

A232802 Number of solution pairs (x,y) for x <= 11 such that x! + n = y^2 (Brocard-Ramanujan Diophantine equation) is soluble over the integers.

Table of values

n a(n)
1 3
2 1
3 2
4 0
5 0
6 0
7 1
8 1
9 1
10 1
11 0
12 1
13 0
14 1
15 1
16 0
17 0
18 0
19 1
20 0
21 0
22 0
23 1
24 2
25 1
26 0
27 0
28 0
29 0
30 1
31 0
32 0
33 0
34 1
35 1
36 0
37 0
38 0
39 0
40 1
41 0
42 0
43 1
44 0
45 0
46 0
47 1
48 1
49 1
50 0
51 0
52 0
53 0
54 0
55 0
56 0
57 1
58 1
59 0
60 0
61 0
62 1
63 1
64 1
65 0
66 0
67 0
68 0
69 0
70 0
71 0
72 0
73 0
74 0
75 1
76 2
77 0
78 0
79 1
80 1
81 1
82 0

List of values

[3, 1, 2, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 1, 1, 1, 0]