66640

Appears in sequences

• a(n) = n*(n+1)*(n^2+5*n+18)/24.at n=33A051744
• Numbers n such that every digit of both n and n^2 contains a loop (only digits 0,4,6,8,9 in n and n^2).at n=21A107626
• Number of permutations of length n which avoid the patterns 1423, 3421.at n=9A116710
• Numbers k such that k and k^2 use only the digits 0, 4, 6, 8 and 9.at n=22A136956
• Number of (w,x,y,z) with all terms in {1,...,n} and w^2>x^2+y^2+z^2.at n=27A212094
• G.f.: 1/(1 - x*(1-x^3)/(1 - x^2*(1-x^4)/(1 - x^3*(1-x^5)/(1 - x^4*(1-x^6)/(1 - ...))))), a continued fraction.at n=30A227360
• 4*(n + 7)^3 - 27*(n + 7)^2 = (4*n +1)*(n+7)^2.at n=21A245033
• Number of partitions of (3, n) into a sum of distinct pairs.at n=36A268346
• Number of n X 2 0..1 arrays with no 1 equal to more than two of its horizontal and vertical neighbors, with the exception of exactly one element.at n=8A283197
• T(n,k)=Number of nXk 0..1 arrays with no 1 equal to more than two of its horizontal and vertical neighbors, with the exception of exactly one element.at n=46A283203
• a(n) = 3*n^3 + n^2.at n=28A294315
• Numbers k such that k*A003557(A003961(k)) divides A353790(k), where A353790(n) = phi(A003973(n)) * A064989(A003973(n)).at n=20A353797
• a(n) = 5*binomial(n,6) + 2*binomial(n,4).at n=17A384733