|
Search: id:A058498
|
|
|
| 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). |
|
+0
2
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
1,8
|
|
|
EXAMPLE
|
a(8) = 2 because there are two solutions: 1-3+6+10+15-21+28-36 = 1-3-6+10-15+21+28-36 = 0.
|
|
CROSSREFS
|
Cf. A000217.
Sequence in context: A057720 A087996 A086777 this_sequence A003076 A011123 A087464
Adjacent sequences: A058495 A058496 A058497 this_sequence A058499 A058500 A058501
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
Naohiro Nomoto (6284968128(AT)geocities.co.jp), Dec 20 2000
|
|
EXTENSIONS
|
More terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Oct 13 2001
|
|
|
Search completed in 0.002 seconds
|
