23850

Appears in sequences

• Let F(x) = 1 + 1*x + 4*x^2 + 10*x^3 + ..., the g.f. for A000293 (solid partitions), and write F(x) = 1/Product_{n>=1} (1 - x^n)^a(n).at n=24A037452
• Numbers n such that (digital sum of n)^3 = reversal of n. (Powers of 10 excluded.)at n=5A085754
• Coefficient of X^2 in expansion of (1 + n*X + n*X^2)^n.at n=14A092365
• Terms in A112039 that are divisible by 3, divided by 3.at n=38A112040
• Numbers n such that 1 + Sum{k=1..n/2} A001223(2k-1)*(-1)^k = 0.at n=17A130642
• Numbers n such that 1 - S(n) = 0, where S(n) = (S(n-1) + A000040(n))*(-1)^n; S(0)=0, n=>1.at n=22A131197
• a(n) = a(n-1) + a(n-2) + a(n-3) with a(1) = 2, a(2) = 3, a(3) = 4.at n=16A145027
• a(n) is the optimal wire-length for an n X n grid.at n=29A195647
• a(n) = Sum_{i=0..n} digsum(i)^3, where digsum(i) = A007953(i).at n=50A231688
• Sums of two primes (in increasing order) when equal to the product of their prime-counting functions.at n=12A272860
• a(n) = (n^2 + 1) * (2*n - 1).at n=22A290631
• a(n) = 3*(n+1)*(9*n+4).at n=29A304503
• Expansion of Product_{k>=0} (1 + x^(3^k) + x^(2*3^k) + x^(3^(k+1)))^(3^k).at n=52A309046
• Numbers k that are divisible by sum(pi)^2+sum(ei) where k=p1^e1*...*pj^ej with pi primes.at n=28A321456
• Triangle read by rows: T(n,k) is the number of multiset partitions of weight n whose union is a k-set where each part has a different size.at n=50A332253
• a(n) = coefficient of x^n in A(x) = Sum_{n>=0} C(x)^n * (1 - C(x)^n)^n, where C(x) = x + C(x)^2 is a g.f. of the Catalan numbers (A000108).at n=11A357792
• a(n) = Sum_{k=0..floor(n/4)} Stirling2(k,n - 4*k).at n=46A357941
• Expansion of e.g.f. (1/x) * Series_Reversion( x*(1 - x^2*(exp(x) - 1))^3 ).at n=6A376439