131232

Appears in sequences

• a(n) = [ a(n-1)/a(1) ] + [ a(n-3)/a(3) ] + [ a(n-5)/a(5) ] + ..., for n >= 3.at n=38A022866
• Number of ways to arrange integers 1...n so that the sum of each adjacent pair is a triangular number, not counting reversals.at n=26A116980