35213

Appears in sequences

• Denominators of continued fraction convergents to sqrt(391).at n=12A041743
• Triangle read by rows: T(n,k) is the number of Motzkin paths of length n with k peaks (n>=0, 0<=k<=floor(n/2)).at n=57A097860
• Number of (1,0) steps in all peakless Motzkin paths of length n (can be easily translated into RNA secondary structure terminology).at n=12A110236
• Irregular array read by rows, where n-th row gives denominators of the Egyptian fraction expansion, derived using the greedy algorithm, for the absolute value of the fractional part of the (2n)th Bernoulli number.at n=48A136375
• a(n) = Sum_{k=floor(n/4)..R} C(k, m*k - (-1)^n*(R - k)) * C(k + 1, m*(k + 2) - (-1)^n*(R - k + 1)) where m = (n + 1) mod 2 and R = (n + m - 3)/2 for n > 0 and a(0) = 1.at n=27A202411
• Composite numbers n such that the distinct digits in n and the distinct digits in the proper divisors of n are the same.at n=20A237713
• Number of nX7 integer arrays with each element equal to the number of horizontal and antidiagonal neighbors not equal to itself.at n=11A265990
• Numbers k such that the set of all the decimal digits of k is the same as the set of all the decimal digits of the proper divisors of k.at n=21A282755
• a(n) = hypergeom([-n, 1 + n, 2 + n, -1 - n], [1/2, 1/2, 1], 1/16). Row sums of A370233.at n=6A370234