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.

A064414 Fix a > 0, b > 0, k > 0 and define G_1 = a, G_2 = b, G_k = G_(k-1) + G_(k-2); sequence gives numbers m such that there exists (a, b) where G_k is divisible by m.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 6
6 7
7 9
8 14
9 23
10 27
11 43
12 49
13 67
14 81
15 83
16 86
17 98
18 103
19 127
20 134
21 163
22 167
23 206
24 223
25 227
26 243
27 254
28 283
29 326
30 343
31 367
32 383
33 443
34 446
35 463
36 467
37 487
38 503
39 523
40 529
41 547
42 566
43 587
44 607
45 643
46 647
47 683
48 686
49 727
50 729
51 734
52 787
53 823
54 827
55 863
56 883
57 887

List of values

[1, 2, 3, 4, 6, 7, 9, 14, 23, 27, 43, 49, 67, 81, 83, 86, 98, 103, 127, 134, 163, 167, 206, 223, 227, 243, 254, 283, 326, 343, 367, 383, 443, 446, 463, 467, 487, 503, 523, 529, 547, 566, 587, 607, 643, 647, 683, 686, 727, 729, 734, 787, 823, 827, 863, 883, 887]