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.

A249861 a(n) are values of k that yield "record-breaking" integer sequence lengths for the recursion: b(i) = 3*(b(i-1) + b(i-2))/2, with b(0) = 1 and b(1) = k.

Table of values

n a(n)
1 1
2 5
3 37
4 101
5 229
6 485
7 2533
8 6629
9 23013
10 88549
11 219621
12 481765
13 1006053
14 3103205
15 7297509
16 24074725
17 158292453
18 1232034277
19 3379517925
20 7674485221
21 282552392165
22 1382064019941
23 5780110531045
24 14576203553253
25 84944947730917
26 647894901152229

List of values

[1, 5, 37, 101, 229, 485, 2533, 6629, 23013, 88549, 219621, 481765, 1006053, 3103205, 7297509, 24074725, 158292453, 1232034277, 3379517925, 7674485221, 282552392165, 1382064019941, 5780110531045, 14576203553253, 84944947730917, 647894901152229]