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.

A115337 a(n) is the smallest number representable in exactly n ways as a sum of 3 palindromes (each of them >= 0).

Table of values

n a(n)
1 0
2 2
3 3
4 4
5 5
6 28
7 6
8 7
9 24
10 8
11 22
12 9
13 10
14 88
15 11
16 12
17 13
18 15
19 189
20 211
21 121
22 110
23 243
24 244
25 143
26 268
27 176
28 165
29 187
30 303
31 337
32 335
33 325
34 343
35 334
36 323
37 345
38 373
39 391
40 383
41 404
42 393
43 458
44 423
45 426
46 435
47 413
48 446
49 454
50 492
51 517
52 505
53 464
54 538
55 527
56 474
57 549
58 547

List of values

[0, 2, 3, 4, 5, 28, 6, 7, 24, 8, 22, 9, 10, 88, 11, 12, 13, 15, 189, 211, 121, 110, 243, 244, 143, 268, 176, 165, 187, 303, 337, 335, 325, 343, 334, 323, 345, 373, 391, 383, 404, 393, 458, 423, 426, 435, 413, 446, 454, 492, 517, 505, 464, 538, 527, 474, 549, 547]

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

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