28770

Appears in sequences

• Numbers whose base-13 representation has exactly 5 runs.at n=25A043660
• G.f.: (1-2*x*c(x))/(1-3*x*c(x)) where c(x) = (1 - sqrt(1-4*x))/(2*x) is the g.f. for Catalan numbers A000108.at n=8A049027
• Square array read by antidiagonals: T(n,k)=(T(n,k-1)*n^2-Catalan(k-1))/(n-1) with a(n,1)=1 and a(1,k)=Catalan(k) where Catalan(k)=C(2k,k)/(k+1)=A000108(k).at n=47A067345
• Square array read by ascending antidiagonals in which row n has g.f. C/(1-n*x*C) where C = (1/2-1/2*(1-4*x)^(1/2))/x = g.f. for Catalan numbers A000108.at n=62A076038
• A number triangle based on the Catalan numbers.at n=58A110488
• Riordan array (1/(1-xc(2x)),xc(2x)/(1-xc(2x))), c(x) the g.f. of A000108.at n=39A110506
• Riordan array (1/(1-3x*c(x)),xc(x)), c(x) the g.f. of A000108.at n=37A117375
• Triangle read by rows: T(n,k) = a(k)*binomial(n,k) (0 <= k <= n), where a(0)=1, a(1)=2, a(k) = a(k-1) + 3*a(k-2) for k >= 2 (a(k) = A006138(k)).at n=61A124959
• Coefficients in a q-analog of the LambertW function, as a triangle read by rows.at n=50A152290
• a(n) = 18522*n - 8274.at n=1A157735
• Least even number m which can be written as sum of 2n primes p(1) < ... < p(2n) < m/2 such that m-p(i) is also prime for i=1,...,2n.at n=32A191837
• Least even number m which can be written as sum of 2n primes p(1) < ... < p(2n) < m/2 such that m-p(i) is also prime for i=1,...,2n.at n=33A191837
• G.f. satisfies: A(x) = A(x^2)^3 + x*A(x^2)^2.at n=24A195200
• Antidiagonal sums of the convolution array A213773.at n=13A213818
• The Szeged index of the n-sunlet graph (n>=3).at n=27A228600
• a(n) = 2^(2*n-1) * ( binomial(3*n/2,n) + binomial((3*n-1)/2,n) ).at n=5A244039
• Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 625", based on the 5-celled von Neumann neighborhood.at n=17A283374
• Number of odd parts in the partitions of n into 10 parts.at n=42A309660