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.

A050416 a(1)=a(2)=1, then a(n+1) = floor(a(n)/3) if this is not among 0, a(1), ..., a(n); otherwise a(n+1) = a(n) + a(n-1).

Table of values

n a(n)
1 1
2 1
3 2
4 3
5 5
6 8
7 13
8 4
9 17
10 21
11 7
12 28
13 9
14 37
15 12
16 49
17 16
18 65
19 81
20 27
21 108
22 36
23 144
24 48
25 192
26 64
27 256
28 85
29 341
30 113
31 454
32 151
33 50
34 201
35 67
36 22
37 89
38 29
39 118
40 39
41 157
42 52
43 209
44 69
45 23
46 92
47 30
48 10
49 40
50 50
51 90
52 140
53 46
54 15
55 61
56 20
57 6
58 26
59 32

List of values

[1, 1, 2, 3, 5, 8, 13, 4, 17, 21, 7, 28, 9, 37, 12, 49, 16, 65, 81, 27, 108, 36, 144, 48, 192, 64, 256, 85, 341, 113, 454, 151, 50, 201, 67, 22, 89, 29, 118, 39, 157, 52, 209, 69, 23, 92, 30, 10, 40, 50, 90, 140, 46, 15, 61, 20, 6, 26, 32]