login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A332415
a(n) is the number of distinct valid solutions taking into account the ambiguity of open and closed absolute value bars for an input of -1 to -2*(n)-1 with absolute value bars between each (|-1|, |-1|-2|-3|, |-1|-2|-3|-4|-5|, etc.).
0
1, 2, 5, 13, 39, 124, 403, 1304, 4301, 14370, 47575, 157153, 512311, 1663977, 5446573
OFFSET
1,2
COMMENTS
a(5) is the solution to Jim Propp's submitted problem published in FiveThirtyEight's "The Riddler" column.
EXAMPLE
For n = 2 (input of |-1|-2|-3|-4|-5|) the solutions are 5 and -5, so a(2) = 2.
CROSSREFS
Sequence in context: A151446 A239106 A022894 * A149861 A148305 A104447
KEYWORD
nonn,more
AUTHOR
Tyler Barron, Feb 12 2020
STATUS
approved