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.

A374143 a(n) is the smallest number which can be represented as the sum of two distinct nonzero octagonal numbers in exactly n ways, or -1 if no such number exists.

Table of values

n a(n)
1 9
2 1053
3 12641
4 68141
5 365641
6 953181
7 2830641
8 6232341
9 13969041
10 23211261
11 104733741
12 84994021
13 175873641
14 159851141
15 538547641
16 602713041
17 810204416
18 1019740041
19 1053265741
20 1972957241
21 3339356041
22 5914492241
23 6886737541
24 6388758241
25 8902368041
26 7858982841
27 4942246941
28 18439299341
29 26639916441

List of values

[9, 1053, 12641, 68141, 365641, 953181, 2830641, 6232341, 13969041, 23211261, 104733741, 84994021, 175873641, 159851141, 538547641, 602713041, 810204416, 1019740041, 1053265741, 1972957241, 3339356041, 5914492241, 6886737541, 6388758241, 8902368041, 7858982841, 4942246941, 18439299341, 26639916441]

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

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