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.

A278288 a(n) is the number of ways to represent a(n-1) as a sum of two distinct terms from a(0) to a(n-2). a(0) = 0. a(1) = a(2) = 1.

Table of values

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

List of values

[0, 1, 1, 1, 2, 3, 3, 4, 6, 2, 4, 8, 3, 8, 4, 12, 6, 10, 10, 11, 12, 15, 9, 12, 19, 7, 15, 17, 10, 18, 22, 17, 12, 22, 21, 22, 25, 25, 26, 22, 26, 26, 27, 32, 25, 30, 27, 35, 21, 23, 31, 31, 32, 37, 37, 38, 37, 39, 37, 40, 40, 41, 45, 28, 37, 42, 38, 50, 33, 43, 58, 34]

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

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