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.

A319396 Number of partitions of n into exactly three positive Fibonacci numbers.

Table of values

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

List of values

[0, 0, 0, 1, 1, 2, 2, 3, 2, 3, 2, 3, 3, 2, 2, 3, 2, 3, 3, 3, 1, 2, 1, 3, 3, 2, 2, 3, 2, 3, 1, 3, 1, 0, 2, 1, 2, 3, 2, 3, 2, 1, 2, 2, 3, 2, 0, 3, 1, 1, 3, 0, 1, 0, 0, 2, 1, 2, 2, 2, 3, 2, 1, 3, 1, 2, 1, 0, 2, 2, 2, 3, 0, 2, 0, 0, 3, 1, 1, 1, 0, 3, 0, 0, 1, 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.