43243

Appears in sequences

• Permutation rooted trees with n nodes.at n=10A050383
• a(n) = n^n - (n-1)^(n-1) - (n-2)^(n-2) - ... - 1.at n=5A173142
• Fibonacci-x^x where x is largest integer such that x^x is smaller than Fibonacci.at n=21A174255
• G.f. satisfies: A(x) = 1 + x/A(-x*A(x)^4).at n=9A213093
• Let p = first digit of n, q = number obtained if p is removed from n; let r = last digit of n, s = number obtained if r is removed from n; sequence give n such that p*q = r*s != 0, p! = q, and r! = s.at n=35A245364
• Numbers N such that N = P//Q = R//S, where // is the concatenation function, satisfying the following properties: P and S are m-digit integers, Q and R are k-digit integers, k and m are distinct positive integers, and P*Q = R*S.at n=37A245385
• Numbers in A245385 where P, Q, R, and S are all distinct.at n=16A245386
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of B(x)^k, where B(x) is the g.f. of A213093.at n=64A384866