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.

A317778 Starting with 1,2,3,4,5,6: a(n) is the next smallest number greater than a(n-1) such that a[i] + a[j] + a[k] != a[x] + a[y] + a[z] for 1 <= i,j,k,x,y,z <= n all distinct.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 6
7 13
8 22
9 39
10 72
11 131
12 229
13 386
14 641
15 896
16 1164
17 1419
18 1855
19 2831
20 3545
21 5036
22 5750
23 8034
24 10022
25 12227
26 14377
27 17455
28 19951
29 24701
30 27197
31 36455
32 42303
33 49751
34 57232
35 65684
36 83879
37 94391
38 110073
39 124015
40 137442
41 156835
42 175130
43 209215
44 229396
45 242692

List of values

[1, 2, 3, 4, 5, 6, 13, 22, 39, 72, 131, 229, 386, 641, 896, 1164, 1419, 1855, 2831, 3545, 5036, 5750, 8034, 10022, 12227, 14377, 17455, 19951, 24701, 27197, 36455, 42303, 49751, 57232, 65684, 83879, 94391, 110073, 124015, 137442, 156835, 175130, 209215, 229396, 242692]