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.

A078714 a(n) = smallest number m which can be obtained in n ways by subtracting twice a triangular number from a perfect square.

Table of values

n a(n)
1 1
2 4
3 16
4 34
5 142
6 79
7 1276
8 289
9 394
10 709
11 103336
12 1024
13 930022
14 6379
15 3544
16 2599
17 75331762
18 5119
19 677985856
20 9214
21 31894
22 516679
23 54916854316
24 12994
25 88594
26 4650109
27 30319
28 82924
29 40034386796182
30 46069
31 360309481165636
32 33784
33 2583394
34 376658809
35 797344

List of values

[1, 4, 16, 34, 142, 79, 1276, 289, 394, 709, 103336, 1024, 930022, 6379, 3544, 2599, 75331762, 5119, 677985856, 9214, 31894, 516679, 54916854316, 12994, 88594, 4650109, 30319, 82924, 40034386796182, 46069, 360309481165636, 33784, 2583394, 376658809, 797344]

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

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