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.

A225376 Construct sequences P,Q,R by the rules: Q = first differences of P, R = second differences of P, P starts with 1,5,11, Q starts with 4,6, R starts with 2; at each stage the smallest number not yet present in P,Q,R is appended to R; every number appears exactly once in the union of P,Q,R. Sequence gives P.

Table of values

n a(n)
1 1
2 5
3 11
4 20
5 36
6 60
7 94
8 140
9 199
10 272
11 360
12 465
13 588
14 730
15 893
16 1078
17 1286
18 1519
19 1778
20 2064
21 2378
22 2721
23 3094
24 3498
25 3934
26 4403
27 4907
28 5448
29 6027
30 6645
31 7303
32 8002
33 8743
34 9527
35 10355
36 11228

List of values

[1, 5, 11, 20, 36, 60, 94, 140, 199, 272, 360, 465, 588, 730, 893, 1078, 1286, 1519, 1778, 2064, 2378, 2721, 3094, 3498, 3934, 4403, 4907, 5448, 6027, 6645, 7303, 8002, 8743, 9527, 10355, 11228]

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

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