83990

Appears in sequences

• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, -1), (0, 0, 1), (1, 0, 0), (1, 1, 1)}.at n=8A151121
• Number of subsets of {1..n} (including empty set) such that the pairwise sums of distinct elements are all distinct.at n=25A196723
• Number of maximal cliques in the n-polygon diagonal intersection graph.at n=34A291949