23996

Appears in sequences

• McKay-Thompson series of class 28D for Monster.at n=35A058609
• Triangle, read by rows, where the g.f. of column k, C_k(x), is defined by the recursion: C_k(x) = ( 1 + Sum_{n>=1} x^n*C_{n-1+k}(x) )^(k+1).at n=37A127082
• Column 1 of triangle A127082.at n=7A127084
• a(n) = 686*n - 14.at n=34A157363
• Number of increasing sequences of n integers x(1),...,x(n) with values in 1..4*n such that x(j) divides x(k) iff j divides k.at n=31A180381
• Sum_{0<j<n} (n^4-j^4).at n=6A206810
• Number n such that the sum of its proper evil divisors (A001969) equals n.at n=36A230587
• Number of partitions p of n such that 2*(number of even numbers in p) = (number of odd numbers in p).at n=50A241653
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 489", based on the 5-celled von Neumann neighborhood.at n=31A272512
• p-INVERT of the odd positive integers, where p(S) = 1 - S - S^2 - S^3.at n=7A292494
• Solution of the complementary equation a(n) = a(0)*b(n-1) + a(1)*b(n-2) + ... + a(n-1)*b(0), where a(0) = 1, a(1) = 3, b(0) = 2, and (a(n)) and (b(n)) are increasing complementary sequences.at n=8A296000
• Product_{n>=1} (1 + x^n)^a(n) = g.f. of A000293 (solid partitions).at n=23A305842
• E.g.f. A(x) satisfies A(x) = 1/(1 - x*A(x)*log(1-x)^2).at n=7A392830
• Expansion of e.g.f. 1/(1 + LambertW(-x*log(1-x)^2)).at n=7A392916