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.

A265744 a(n) is the number of Pell numbers (A000129) needed to sum to n using the greedy algorithm (A317204).

Table of values

n a(n)
0 0
1 1
2 1
3 2
4 2
5 1
6 2
7 2
8 3
9 3
10 2
11 3
12 1
13 2
14 2
15 3
16 3
17 2
18 3
19 3
20 4
21 4
22 3
23 4
24 2
25 3
26 3
27 4
28 4
29 1
30 2
31 2
32 3
33 3
34 2
35 3
36 3
37 4
38 4
39 3
40 4
41 2
42 3
43 3
44 4
45 4
46 3
47 4
48 4
49 5
50 5
51 4
52 5
53 3
54 4
55 4
56 5
57 5
58 2
59 3
60 3
61 4
62 4
63 3
64 4
65 4
66 5
67 5
68 4
69 5
70 1
71 2
72 2
73 3
74 3
75 2
76 3
77 3
78 4
79 4
80 3
81 4
82 2
83 3
84 3
85 4
86 4
87 3
88 4
89 4
90 5
91 5
92 4
93 5
94 3
95 4
96 4
97 5
98 5
99 2
100 3
101 3
102 4
103 4
104 3
105 4
106 4
107 5
108 5
109 4
110 5
111 3

List of values

[0, 1, 1, 2, 2, 1, 2, 2, 3, 3, 2, 3, 1, 2, 2, 3, 3, 2, 3, 3, 4, 4, 3, 4, 2, 3, 3, 4, 4, 1, 2, 2, 3, 3, 2, 3, 3, 4, 4, 3, 4, 2, 3, 3, 4, 4, 3, 4, 4, 5, 5, 4, 5, 3, 4, 4, 5, 5, 2, 3, 3, 4, 4, 3, 4, 4, 5, 5, 4, 5, 1, 2, 2, 3, 3, 2, 3, 3, 4, 4, 3, 4, 2, 3, 3, 4, 4, 3, 4, 4, 5, 5, 4, 5, 3, 4, 4, 5, 5, 2, 3, 3, 4, 4, 3, 4, 4, 5, 5, 4, 5, 3]