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.

A107354 To compute a(n) we first write down 2^n 1's in a row. Each row takes the right half of the previous row and each element in it equals sum of the elements in the previous row starting at the middle. The single element in the last row is a(n).

Table of values

n a(n)
0 1
1 1
2 2
3 7
4 44
5 516
6 11622
7 512022
8 44588536
9 7718806044
10 2664170119608
11 1836214076324153
12 2529135272371085496
13 6964321029630556852944
14 38346813253279804426846032
15 422247020982575523983378003936
16 9298487213328788062025571134762096

List of values

[1, 1, 2, 7, 44, 516, 11622, 512022, 44588536, 7718806044, 2664170119608, 1836214076324153, 2529135272371085496, 6964321029630556852944, 38346813253279804426846032, 422247020982575523983378003936, 9298487213328788062025571134762096]