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.

A021006 Pisot sequence P(4,11), a(0)=4, a(1)=11, a(n+1) is the nearest integer to a(n)^2/a(n-1). Evidently satisfies a(n) = 2*a(n-1)+2*a(n-2).

Table of values

n a(n)
0 4
1 11
2 30
3 82
4 224
5 612
6 1672
7 4568
8 12480
9 34096
10 93152
11 254496
12 695296
13 1899584
14 5189760
15 14178688
16 38736896
17 105831168
18 289136128
19 789934592
20 2158141440
21 5896152064
22 16108587008
23 44009478144
24 120236130304
25 328491216896
26 897454694400
27 2451891822592
28 6698693033984
29 18301169713152
30 49999725494272
31 136601790414848

List of values

[4, 11, 30, 82, 224, 612, 1672, 4568, 12480, 34096, 93152, 254496, 695296, 1899584, 5189760, 14178688, 38736896, 105831168, 289136128, 789934592, 2158141440, 5896152064, 16108587008, 44009478144, 120236130304, 328491216896, 897454694400, 2451891822592, 6698693033984, 18301169713152, 49999725494272, 136601790414848]