40698

Appears in sequences

• a(n) = T(2n,n-1), where T is defined in A026022.at n=8A026030
• T(n,k) = S(2n,n-1,k-1), 0 <= k <= n, n >= 0, array S as in A050157.at n=49A050160
• T(n, k) = S(2n+2, n+2, k+2) for 0<=k<=n and n >= 0, array S as in A050157.at n=39A050163
• Number of primitive (period n) periodic palindromes using a maximum of four different symbols.at n=13A056495
• a(n) = n*(n+1)*(n+2)*(n+4)*(n+23)/120.at n=16A101855
• Numbers k such that if you subtract k from its reversal you get a positive number with the same digits as k.at n=14A121970
• Triangle T(n,k), 0 <= k <= n, read by rows defined by: T(0,0)=1, T(n,k)=0 if k < 0 or if k > n, T(n,0) = 4*T(n-1,0) + T(n-1,1), T(n,k) = T(n-1,k-1) + 5*T(n-1,k) + T(n-1,k+1) for k >= 1.at n=40A126331
• G.f. satisfies: A(x - x^3) = x^3 - x^9.at n=14A140093
• Convolution of A008805 (triangular numbers repeated) with itself.at n=33A177747
• Number of partitions p of n such that (sum of parts with multiplicity 1) <= (sum of all other parts).at n=44A240449
• Number of ways 2*n-1 people can vote on three candidates so that the Condorcet paradox arises.at n=17A277935
• Numbers k such that A060648(k) is divisible by k.at n=6A307227
• a(n) is the number of edges formed by n-secting the angles of a nonagon (enneagon).at n=35A335783