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.

A225377 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 Q.

Table of values

n a(n)
1 4
2 6
3 9
4 16
5 24
6 34
7 46
8 59
9 73
10 88
11 105
12 123
13 142
14 163
15 185
16 208
17 233
18 259
19 286
20 314
21 343
22 373
23 404
24 436
25 469
26 504
27 541
28 579
29 618
30 658
31 699
32 741
33 784
34 828
35 873
36 920
37 968
38 1017
39 1067
40 1118
41 1170

List of values

[4, 6, 9, 16, 24, 34, 46, 59, 73, 88, 105, 123, 142, 163, 185, 208, 233, 259, 286, 314, 343, 373, 404, 436, 469, 504, 541, 579, 618, 658, 699, 741, 784, 828, 873, 920, 968, 1017, 1067, 1118, 1170]

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

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