34504

Appears in sequences

• Smallest n-aspiring number. That is, a(n) = smallest k such that s^(n)(k) is perfect but s^(n-1)(k) is not, where s(k) is the sum of the aliquot parts of k and s^(i) means iterate s i times.at n=20A099771
• Number of n X 2 binary arrays with some element plus some horizontally, vertically or antidiagonally adjacent neighbor totalling two not more than once.at n=10A269083
• E.g.f. satisfies: A(x)^A(x) = 1 + x*A(x).at n=8A349587