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.

A330407 Number of ordered integer pairs (b,c) with -n <= b <= n and -n <= c <= n such that both roots of x^2 + b*x + c = 0 are distinct integers.

Table of values

n a(n)
0 0
1 3
2 7
3 13
4 20
5 26
6 36
7 42
8 52
9 59
10 69
11 75
12 89
13 95
14 105
15 115
16 126
17 132
18 146
19 152
20 166
21 176
22 186
23 192
24 210
25 217
26 227
27 237
28 251
29 257
30 275
31 281
32 295
33 305
34 315
35 325
36 344
37 350
38 360
39 370
40 388
41 394
42 412
43 418
44 432
45 446
46 456
47 462
48 484
49 491
50 505
51 515
52 529
53 535
54 553
55 563
56 581

List of values

[0, 3, 7, 13, 20, 26, 36, 42, 52, 59, 69, 75, 89, 95, 105, 115, 126, 132, 146, 152, 166, 176, 186, 192, 210, 217, 227, 237, 251, 257, 275, 281, 295, 305, 315, 325, 344, 350, 360, 370, 388, 394, 412, 418, 432, 446, 456, 462, 484, 491, 505, 515, 529, 535, 553, 563, 581]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.