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.

A337136 a(1) = 1, a(2) = 2; for n > 1, a(n) = smallest positive number which has not yet appeared which has a common factor with a(n-2) + a(n-1).

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 4
6 6
7 8
8 7
9 9
10 10
11 19
12 29
13 12
14 41
15 53
16 14
17 67
18 15
19 16
20 31
21 47
22 13
23 18
24 62
25 20
26 22
27 21
28 43
29 24
30 134
31 26
32 25
33 17
34 27
35 11
36 28
37 30
38 32
39 34
40 33
41 201
42 36
43 39
44 35
45 37
46 38
47 40
48 42
49 44
50 46
51 45
52 49
53 48
54 97
55 50
56 51
57 101
58 52
59 54
60 56
61 55
62 57
63 58
64 23
65 60
66 83
67 65

List of values

[1, 2, 3, 5, 4, 6, 8, 7, 9, 10, 19, 29, 12, 41, 53, 14, 67, 15, 16, 31, 47, 13, 18, 62, 20, 22, 21, 43, 24, 134, 26, 25, 17, 27, 11, 28, 30, 32, 34, 33, 201, 36, 39, 35, 37, 38, 40, 42, 44, 46, 45, 49, 48, 97, 50, 51, 101, 52, 54, 56, 55, 57, 58, 23, 60, 83, 65]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.