18792

Appears in sequences

• Even heptagonal numbers (A000566).at n=43A014640
• a(n) = (2*n + 1)*(5*n + 1).at n=43A033571
• Number of polyominoes with n cells, symmetric about diagonal 2.at n=37A056878
• Composite numbers k such that sigma(k)*(phi(k) + 2) is a square.at n=29A065655
• Number of 2 X 2 symmetric matrices over Z(n) having nonzero determinant.at n=26A115077
• Least n such that nextprime(p*n) > p*nextprime(n) where p runs through the prime numbers (if p is prime then nextprime(p)=p).at n=27A117102
• Totally multiplicative sequence with a(p) = 2*(4p+1) = 8p+2 for prime p.at n=27A167336
• Numbers of the form p^4*q^3*r where p, q, and r are distinct primes.at n=23A179698
• The number of ways to color n balls in a row with 3 colors with no color runs having lengths greater than 4. This sequence is a special case of the general problem for coloring n balls in a row with p colors where each color has a given maximum run-length. In this example, the bounds are uniformly 4. It can be phrased in terms of tossing a p-faced die n times, requiring each face to have no runs longer than b.at n=8A181140
• Half the number of (n+2) X (n+2) binary arrays with each 3 X 3 subblock having sum 3, 4, 5 or 6.at n=1A187308
• Half the number of (n+2)X4 binary arrays with each 3X3 subblock having sum 3, 4, 5 or 6.at n=1A187310
• T(n,k)=Half the number of (n+2)X(k+2) binary arrays with each 3X3 subblock having sum 3, 4, 5 or 6.at n=4A187317
• Integer areas A of the integer-sided triangles such that the product of the inradius and the circumradius is a square.at n=26A232329
• Number of (n+2) X (7+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 3 5 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 3 5 6 or 7.at n=12A252383
• Expansion of Product_{k>=1} 1/(1 - 2*x^(k^2)).at n=14A291583
• Coefficients in expansion of (E_4^3/E_6^2)^(1/16).at n=2A299951
• a(n) is the first Zagreb index of the Fibonacci cube Gamma(n).at n=11A306967
• Numbers of (undirected) Hamiltonian paths in the complete tripartite graph K_{n,n,n}.at n=2A307936
• Triangle read by rows: T(n,k) is the number of sets of rooted hypertrees on a total of n unlabeled nodes with a total of k edges, (0 <= k < n).at n=62A318607
• a(n) = 3^n * [x^n] Product_{k>=1} ((1 + 3*x^k)/(1 - 3*x^k))^(1/3).at n=5A370752