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.

A256133 Numbers that have unique expansion with minimal digit sum in terms of Fibonacci numbers F_k (k > 1).

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 7
6 8
7 9
8 11
9 13
10 14
11 15
12 18
13 20
14 21
15 22
16 23
17 24
18 29
19 30
20 32
21 34
22 35
23 36
24 37
25 39
26 41
27 47
28 48
29 49
30 52
31 54
32 55
33 56
34 57
35 58
36 60
37 62
38 63
39 64
40 66
41 76
42 77
43 78
44 79
45 84
46 85
47 87
48 89
49 90
50 91
51 92
52 94
53 96
54 97
55 98
56 100
57 102
58 103
59 104
60 107
61 109
62 123
63 124
64 125
65 126

List of values

[1, 2, 3, 5, 7, 8, 9, 11, 13, 14, 15, 18, 20, 21, 22, 23, 24, 29, 30, 32, 34, 35, 36, 37, 39, 41, 47, 48, 49, 52, 54, 55, 56, 57, 58, 60, 62, 63, 64, 66, 76, 77, 78, 79, 84, 85, 87, 89, 90, 91, 92, 94, 96, 97, 98, 100, 102, 103, 104, 107, 109, 123, 124, 125, 126]