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.

A350240 Number of representations of n as a sum of distinct Fibonacci numbers where 1 can be included twice.

Table of values

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

List of values

[1, 1, 2, 2, 2, 3, 2, 3, 3, 3, 4, 3, 3, 4, 3, 5, 4, 4, 5, 3, 4, 4, 4, 6, 5, 5, 6, 4, 6, 5, 5, 6, 4, 4, 5, 4, 7, 6, 6, 8, 5, 7, 6, 6, 8, 6, 6, 7, 5, 8, 6, 6, 7, 4, 5, 5, 5, 8, 7, 7, 9, 6, 9, 8, 8, 10, 7, 7, 8, 6, 10, 8, 8, 10, 6, 8, 7, 7, 10, 8, 8, 9, 6]

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

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