56330

Appears in sequences

• Smallest k > 1 such that (sum of digits of k^n)*(sum of digits of k^(n+1)) = k, or 0 if no such k exists.at n=12A126783
• Number of nonisomorphic unordered triples of involutions on an n-set.at n=10A362650
• a(n) is the total number of paths starting at (0, 0), ending at (n, 0), consisting of steps (1, 1), (1, 0), (1, -3), and staying on or above y = -2.at n=14A379464