19220

Appears in sequences

• Sum of first n terms divides the concatenation of the first n terms.at n=16A166064
• Riordan array (((1+x)/(1-x-x^2))^m, x*A000108(x)), m=3.at n=46A185678
• a(n) = 20*n^2.at n=31A195322
• G.f. satisfies: A(x) = (1 + 3*x*A(x))^2 * (3 + A(x)) / 4.at n=4A231618
• Numbers n such that the sum of n consecutive positive cubes is a cube for some initial starting number k.at n=30A240970
• a(n) = n*(25*n - 39)/2.at n=40A263231
• Number of nX5 0..1 arrays with no 1 equal to more than three of its horizontal, diagonal and antidiagonal neighbors.at n=2A283854
• T(n,k)=Number of nXk 0..1 arrays with no 1 equal to more than three of its horizontal, diagonal and antidiagonal neighbors.at n=23A283857
• Number of 3Xn 0..1 arrays with no 1 equal to more than three of its horizontal, diagonal and antidiagonal neighbors.at n=4A283859
• Expansion of Product_{k>0} (1 - k^2*x^k)^(1/k).at n=19A294620
• Expansion of Product_{n>=1} ((1 + (n*x)^n)/(1 - (n*x)^n))^(1/n).at n=6A303344
• Number of binary squares of length 2n that neither begin nor end with a shorter square.at n=17A323443
• Nonnegative values x of solutions (x, y) to the Diophantine equation x^2 + (x + 31^2)^2 = y^2.at n=10A331265
• a(n) = n^n - Sum_{k=1..n-2} f_k(n), with f_k(n)=( floor( (n^n - Sum_{t=1..k-1} f_t(n))^(1/(n-k)) ) )^(n-k).at n=44A349184