18590

Appears in sequences

• a(n) = Sum_{k=1..n} floor((n/k) * floor((n/k) * floor(n/k))).at n=24A024922
• OR-convolution of squares A000290 with themselves.at n=29A033459
• (Terms in A028286)/2.at n=31A051359
• (Terms in A029665)/2.at n=43A051425
• (Terms in A029643)/2.at n=36A051469
• Numbers k such that 2*3^k - 7 is prime.at n=28A059454
• a(n) = NumberOfPartitions(n) * ( tau(n)-1 ).at n=27A141670
• Number of reduced words of length n in the Weyl group B_10.at n=8A161755
• Number of reduced words of length n in the Weyl group D_10.at n=8A162248
• G.f. satisfies: A(x) = ( Sum_{n>=0} q^(n*(n+1)/2) )^8 where q=x*A(x).at n=4A194042
• a(n) = Sum_{k=0..n} (k+1)^2*T(n,k)^2 where T(n,k) is the Catalan triangle A039598.at n=4A228329
• Triangle T(n,k), 0 <= k <= n, read by rows defined by: T(n,k) = (binomial(2*n,2*k) + binomial(2*n+1,2*k))/2.at n=40A232535
• Number of (n+2)X(2+2) 0..3 arrays with every 3X3 subblock row and column sum unequal to 4 or 5 and every diagonal and antidiagonal sum equal to 4 or 5.at n=7A251899
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum unequal to 4 or 5 and every diagonal and antidiagonal sum equal to 4 or 5.at n=37A251905
• Rectangular array A read by upward antidiagonals in which the entry in row n and column k is defined by A(n,k) = S(4*A257499(n,k) - 3), n,k >= 1, where the function S is as defined in A257480.at n=47A254067
• Irregular triangle read by rows: T(n,i) = number of n X n semi-canonical binary matrices with exactly i 1's, where 0 <= i <= n^2.at n=70A268523
• Number of n X 3 binary arrays with some element plus some horizontally, vertically or antidiagonally adjacent neighbor totalling two not more than once.at n=6A269084
• Number of nX7 binary arrays with some element plus some horizontally, vertically or antidiagonally adjacent neighbor totalling two not more than once.at n=2A269088
• T(n,k)=Number of nXk binary arrays with some element plus some horizontally, vertically or antidiagonally adjacent neighbor totalling two not more than once.at n=38A269089
• T(n,k)=Number of nXk binary arrays with some element plus some horizontally, vertically or antidiagonally adjacent neighbor totalling two not more than once.at n=42A269089