32889

Appears in sequences

• a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = A001950 (upper Wythoff sequence).at n=37A024689
• s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = A001950 (upper Wythoff sequence).at n=36A025122
• Numbers m such that m*reversal(m) contains every decimal digit exactly once.at n=21A178929
• The smallest number in A355852 whose binary value shares n out of n+1 bits with the concatenation of the binary values of its divisors' product.at n=10A355857
• G.f. A(x) satisfies x = Sum_{n>=1} A( x^n*(1-x)^(3*n) ).at n=6A380552
• a(n) is the graph corresponding to A076184(n), encoded as in A382754.at n=39A382756