35542

Appears in sequences

• a(n)=Sum{T(n,j): j=1,2,...,n}, array T given by A048212.at n=35A048222
• Number of -7..7 arrays x(0..n-1) of n elements with zero sum and no two consecutive declines, no adjacent equal elements, and no element more than one greater than the previous (random base sawtooth pattern).at n=11A200180
• The number of monic integer polynomials of degree n all of whose roots are distinct and of modulus at most 1.at n=31A280709
• Number of even parts in the partitions of n into 8 parts.at n=48A309630
• Triangle read by rows: T(n,k) is the number of configurations with exactly k polyomino matchings in a generalized game of memory played on the path of length 5n.at n=18A334058