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.

A106027 Smallest m > n such that the Zeckendorf partition of m contains that of n.

Table of values

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

List of values

[4, 7, 4, 12, 6, 19, 20, 9, 12, 31, 12, 33, 14, 17, 20, 17, 51, 19, 53, 54, 22, 25, 28, 25, 33, 27, 82, 83, 30, 33, 86, 33, 88, 35, 38, 41, 38, 46, 40, 53, 54, 43, 46, 133, 46, 135, 48, 51, 54, 51, 140, 53, 142, 143, 56, 59, 62, 59, 67, 61, 74, 75, 64, 67, 86, 67, 88, 69, 72, 75]

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

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