90135

Appears in sequences

• Number of arrays of -1..1 integers x(1..n) with every x(i) in a subsequence of length 1 or 2 with sum zero.at n=14A193641
• G.f. satisfies: A(x) = Sum_{n>=0} x^n * A(x)^(n*(n+1)/2) / Product_{k=1..n} (1 + x*A(x)^k).at n=12A221586
• 8th-power analog of Keith numbers.at n=13A281919
• Numbers that can be written in exactly two different ways in the form described by A387302.at n=17A387898