187416

Appears in sequences

• a(n) is the least k > 0 such that k and 3k are anagrams in base n (written in base 10).at n=33A023095
• a(1) = 1, a(2) = 5, a(n+2) = 5*a(n+1)+(n+1)*(n+3)*a(n).at n=6A142989