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.

A282756 Let F(k,n) = k*F(k,n-1) + F(k,n-2) with initial conditions F(k,0) = 0, F(k,1) = 1. Sequence lists the minimum 'n' such that F(k,n) > k^n.

Table of values

n a(n)
1 3
2 6
3 14
4 27
5 45
6 70
7 101
8 139
9 184
10 236
11 296
12 364
13 440
14 524
15 616
16 716
17 826
18 943
19 1070
20 1205
21 1350
22 1503
23 1666
24 1838
25 2019
26 2210
27 2410
28 2620
29 2839
30 3069
31 3308
32 3557
33 3815
34 4084
35 4363
36 4652
37 4951
38 5261
39 5580
40 5910
41 6251
42 6601
43 6963
44 7334
45 7717
46 8110
47 8513
48 8928
49 9353
50 9788

List of values

[3, 6, 14, 27, 45, 70, 101, 139, 184, 236, 296, 364, 440, 524, 616, 716, 826, 943, 1070, 1205, 1350, 1503, 1666, 1838, 2019, 2210, 2410, 2620, 2839, 3069, 3308, 3557, 3815, 4084, 4363, 4652, 4951, 5261, 5580, 5910, 6251, 6601, 6963, 7334, 7717, 8110, 8513, 8928, 9353, 9788]