26026

Appears in sequences

• Number of 4-tuples (p_1, p_2, ..., p_4) of Dyck paths of semilength n, such that each p_i is never below p_{i-1}.at n=5A006150
• a(n) = binomial(n,3)*binomial(n-1,3)/4.at n=10A006542
• Expansion of e.g.f.: cos(log(1+log(1+x))).at n=7A009018
• a(n) = 2*(n+1)*binomial(n+2,4).at n=10A027777
• a(n) = 11*(n+1)*binomial(n+2,11)/2.at n=3A027784
• Robbins triangle read by rows: T(n,k) = number of alternating sign n X n matrices with a 1 at top of column k (n >= 1, 1<=k<=n).at n=22A048601
• Robbins triangle read by rows: T(n,k) = number of alternating sign n X n matrices with a 1 at top of column k (n >= 1, 1<=k<=n).at n=26A048601
• Partial sums of A051878.at n=9A050404
• House numbers (version 2): a(n) = (n+1)^3 + (n+1)*Sum_{i=0..n} i.at n=25A050509
• Second diagonal of triangle A048601.at n=5A051106
• Numbers n such that n | 10^n + 9^n + 1.at n=35A057295
• Upper triangle of Catalan Number Wall.at n=40A078920
• Numbers whose name in American English is a word-palindrome, reading the same forward and backward.at n=34A081365
• From enumerating paths in the plane.at n=5A091962
• Triangle read by rows, giving Kekulé numbers for certain benzenoids (see the Cyvin-Gutman book for details).at n=40A123352
• Lengths of bit runs in A123504.at n=47A123505
• a(n) = binomial(m+n-1,n)^2 - binomial(m+n,n+1)*binomial(m+n-2,n-1) with m=12.at n=3A140925
• Number of 3 X 10 matrices with elements in 0..n with each row and each column in nondecreasing order. 3,10,n can be permuted, see formula.at n=2A140926
• a(n) = 1001*n.at n=25A153814
• Values x for records of the minima of the positive distance d between the eleventh power of a positive integer x and the square of an integer y such that d = x^11 - y^2 (x <> k^2 and y <> k^11).at n=48A179794