36957

Appears in sequences

• a(n) = (n-3)*2^n + n*(n+3)/2 + 3.at n=11A104747
• Numbers m such that m*reversal(m) contains every decimal digit exactly once.at n=27A178929
• a(n) = 2*a(n-1) - a(n-3) + 2*a(floor(n/2)) + 3*a(floor(n/3)) + ... + n*a(floor(n/n)), where a(0) = 1, a(1) = 1, a(2) = 1.at n=15A298408