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.

A058498 Number of solutions to c(1)t(1) + ... + c(n)t(n) = 0, where c(i) = +-1 for i>1, c(1) = t(1) = 1, t(i) = triangular numbers (A000217).

Table of values

n a(n)
1 0
2 0
3 0
4 1
5 0
6 1
7 1
8 2
9 0
10 6
11 8
12 13
13 0
14 33
15 52
16 105
17 0
18 310
19 485
20 874
21 0
22 2974
23 5240
24 9488
25 0
26 30418
27 55715
28 104730
29 0
30 352467
31 642418
32 1193879
33 0
34 4165910
35 7762907
36 14493951
37 0
38 50621491
39 95133799
40 179484713
41 0
42 637516130
43 1202062094
44 2273709847
45 0
46 8173584069

List of values

[0, 0, 0, 1, 0, 1, 1, 2, 0, 6, 8, 13, 0, 33, 52, 105, 0, 310, 485, 874, 0, 2974, 5240, 9488, 0, 30418, 55715, 104730, 0, 352467, 642418, 1193879, 0, 4165910, 7762907, 14493951, 0, 50621491, 95133799, 179484713, 0, 637516130, 1202062094, 2273709847, 0, 8173584069]

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

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