19248

Appears in sequences

• OR-convolution of squares A000290 with themselves.at n=30A033459
• Let M = the 3 X 3 matrix [1 1 1; 3 1 0; 2 0 0]. Perform M^n * [1 0 0] getting (1, 3, 2; 6, 6, 2; 14, 24, 12; 50, 66, 28; ...) which we string together to form the sequence.at n=25A107271
• S(n) - the sum of the areas of the polygons constructed from connecting with a straight line all identical members in the multiplicative table modulo n (finite field).at n=29A157023
• Number of (n+4)X(n+4) binary arrays with every 5X5 subblock commuting with each horizontal and vertical neighbor 5X5 subblock.at n=3A186600
• Number of (n+4)X8 binary arrays with every 5X5 subblock commuting with each horizontal and vertical neighbor 5X5 subblock.at n=3A186604
• T(n,k)=Number of (n+4)X(k+4) binary arrays with every 5X5 subblock commuting with each horizontal and vertical neighbor 5X5 subblock.at n=24A186609
• Number of (n+1)X(n+1) 0..3 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 10, and no two adjacent values equal.at n=2A233683
• Number of (n+1)X(3+1) 0..3 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 10, and no two adjacent values equal.at n=2A233686
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 10 (10 maximizes T(1,1)), and no two adjacent values equal.at n=12A233691
• Number of compositions of n such that the first part is 1 and the second differences of the parts are in {-5,...,5}.at n=17A239555
• Number of ways to place non-intersecting diagonals in a convex (n+2)-gon so as to create no hexagons.at n=7A256752
• a(n) = [x^n] ((x + 1)*(2*x - 1)*(2*x^2 - 1))/(2*x^2 + 2*x - 1)^2.at n=9A331320
• a(1) = 1; a(n+1) = Sum_{d|n, gcd(d, n/d) = 1} a(n/d) * a(d).at n=15A333051