84084

Appears in sequences

• a(n) = binomial(2*n+1,n)*(n+1)^2.at n=6A002544
• Numbers k such that k | sigma_3(k) - phi(k)^3.at n=29A055697
• T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.at n=42A063007
• Triangle of coefficients of Bateman polynomial n!Z_n(-x).at n=34A073768
• T(n,k) = binomial(n,2*k)*binomial(2*k,k) for 0 <= k <= n, triangle read by rows.at n=111A089627
• Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,1) (i.e., bilateral Schroeder paths), having k D=(1,1) steps.at n=38A104684
• a(n) = C(n+2,2)*C(n,floor(n/2)).at n=12A107231
• Non-palindromes in A110751; that is, non-palindromic numbers n such that n and R(n) have the same prime divisors, where R(n) = digit reversal of n.at n=16A110819
• Eigentriangle by rows, termwise products of A078812 and its eigensequence, A125274.at n=49A144254
• G.f. is the polynomial (1-x^3) * (1-x^6) * (1-x^9) * (1-x^12) * (1-x^15) * (1-x^18) * (1-x^21) * (1-x^24) * (1-x^27) * (1-x^30) * (1-x^33) / (1-x)^11.at n=9A162628
• Number of 4 X n 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 0 1 and 1 0 0 vertically.at n=10A207753
• Triangle read by rows: T(n,k) = binomial(2*n,k)*Stirling2(2*n-k,n).at n=34A226703
• G.f.: A(x,y) = Sum_{n>=0} exp(-y/(1-n*x)) * y^n/(1-n*x)^n / n!.at n=43A245111
• Triangle read by rows in which the n-th row lists the multinomials A036038 for all partitions of 2n with only even parts in Abramowitz-Stegun ordering.at n=35A257468
• Number of Dyck paths of semilength n such that each positive level has exactly ten peaks.at n=24A288326
• a(n) = 2^n * Sum_{k=0..n} Product_{j=1..k} (2/j)^((-1)^j).at n=13A328002
• Triangle read by rows: T(n,k) is the number of tree-rooted planar maps with n edges and k+1 faces, n >= 0, k = 0..n.at n=30A342982
• Triangle read by rows: T(n,k) is the number of tree-rooted planar maps with n edges and k+1 faces, n >= 0, k = 0..n.at n=33A342982
• A variant of Look and Say sequence (A005150) based on exponents in prime factorization of n (see Comments section for precise definition).at n=27A356008
• Expansion of g.f. A(x,y) satisfying A(x,y) = 1 + x*A(x,y)/(1 - x*y * A(x,y))^2, as a triangle of coefficients T(n,k) of x^n*y^k in A(x,y), read by rows n >= 0.at n=60A365770