23713

Appears in sequences

• Partial sums of (Catalan numbers starting 1, 2, 5, ...).at n=10A014138
• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 98 ones.at n=24A031866
• Transpose of A085178.at n=54A085176
• Array A(x,y) giving the position of the y-th x in A080237 listed by rising antidiagonals.at n=45A085178
• Triangle (read by rows) formed by setting all entries in the first column and in the main diagonal ((i,i) entries) to 1 and the rest of the entries by the recursion T(n, k) = T(n-1, k) + T(n, k-1).at n=75A096465
• Expansion of (1 + sqrt(1 + 4x))/(2(1 + x)).at n=11A099324
• Number of leaf nodes in a binary tree.at n=23A112088
• Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having length of second ascent equal to k (0<=k<=n-1).at n=56A114276
• Fixed points of the permutation A125987/A125988.at n=31A126298
• Fixed points of permutation A071661/A071662.at n=37A126312
• a(n) = A168174(n)-10^12.at n=28A168248
• Centered 32-gonal numbers.at n=38A195315
• Triangle, read by rows, T(n,k) = (k+1)*Sum_{i=0..n-k} C(k+2*i,i)*C(n-i-1,n-k-i)/(k+i+1).at n=56A247582
• Triangle, read by rows, T(n,k) = k*Sum_{i=0..n-k} C(2*i+2*k,i)*C(n-i-1,k-1)/(i+k) for 1 <= k <= n.at n=45A257488
• Number of refinements of the partition n^1 with all numbers taken modulo 2.at n=18A276032
• Number of generalizations of the partition 1^n with all elements taken modulo 2.at n=18A276033
• Triangle read by rows: T(n,k) = T(n,k-1) + T(n-1,k), T(n,0)=1, T(n,n) = T(n,n-1) + 1.at n=64A283054
• Array read by descending antidiagonals, T(n,k) is the number of nodes in the pill tree with initial conditions (n,k), for n and k >= 0.at n=54A335050
• Number of n-step self-avoiding walks on the upper two quadrants of a 2D square lattice where the walk cannot step to the smaller square ring of numbers than the ring it is currently on.at n=11A348008
• Number of integer partitions of n having no permutation with all equal run-lengths.at n=45A382915