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.

A123403 Combining the conditional divide-by-two concept from Collatz sequences with Pascal's triangle, we can arrive at a new kind of triangle. Start with an initial row of just 4. To compute subsequent rows, start by appending a zero to the beginning and end of the previous row. Like Pascal's triangle, add adjacent terms of the previous row to create each of the subsequent terms. The only change is that each term is divided by two if it is even. Then take the center of this triangle. In other words, take the n-th term from the (2n)th row.

Table of values

n a(n)
1 4
2 2
3 3
4 5
5 9
6 15
7 27
8 25
9 47
10 89
11 107
12 119
13 241
14 545
15 699
16 1471
17 3313
18 4288
19 15661
20 31739
21 30813
22 35143
23 92101
24 123614
25 384815
26 788429
27 1532363
28 2995379
29 6281191
30 13569969
31 16900339
32 26062940
33 28141406
34 57780803
35 122540851
36 263162577

List of values

[4, 2, 3, 5, 9, 15, 27, 25, 47, 89, 107, 119, 241, 545, 699, 1471, 3313, 4288, 15661, 31739, 30813, 35143, 92101, 123614, 384815, 788429, 1532363, 2995379, 6281191, 13569969, 16900339, 26062940, 28141406, 57780803, 122540851, 263162577]