57463

Appears in sequences

• a(1) = 1 and for n > 1 let a(n) = a(n-1) + m, where m is the arithmetic mean of the largest subset of all predecessors such that m is an integer and m is maximal.at n=44A063676
• Number of partitions p of n such that (maximal multiplicity of the parts of p) > (number of distinct parts of p).at n=47A240309
• a(n) = Sum_{k=0..floor(n/2)} (k+1) * binomial(k,n-2*k)^2.at n=20A375218
• E.g.f. A(x) satisfies A(x) = exp(x*A(x)/A(-x*A(x))).at n=6A385058
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of e.g.f. B(x)^k, where B(x) is the e.g.f. of A385058.at n=34A385061