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.

A239003 Number of partitions of n into distinct Fibonacci numbers that are all greater than 2.

Table of values

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

List of values

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

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

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