19629

Appears in sequences

• Denominators of continued fraction convergents to sqrt(725).at n=7A042397
• Numbers k such that k^2 contains exactly 9 different digits.at n=35A054037
• a(n+1) = a(n)-th composite number, with a(1) = 11.at n=36A059407
• Numbers whose square is a zeroless pandigital number (i.e., use the digits 1 through 9 once).at n=10A071519
• Pseudo-random numbers: Davenport's generator for 32-bit integers.at n=31A084277
• Chebyshev polynomials S(n,27) with Diophantine property.at n=3A097781
• Triangle, read by rows, where g.f. of row n equals the product of (1-x)^n and the g.f. of the coordination sequence for root lattice B_n, for n >= 0.at n=63A109001
• Number of n X n binary arrays symmetric under 180 degree rotation with all ones connected only in a 0100-1110-0111-0010 pattern in any orientation.at n=12A146916
• a(n) = n^3 - 2*n.at n=27A242135
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 2 3 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 2 3 4 6 or 7.at n=37A252407
• Number of (2+2)X(n+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 2 3 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 2 3 4 6 or 7.at n=7A252409
• Number of unlabeled rooted trees with n nodes where the outdegrees (branching factors) of adjacent nodes differ by at most one.at n=21A260403
• Numbers k such that k![12]+2 is prime, where k![12] is the twelve-fold multifactorial.at n=36A283594
• Numbers whose square contains all of the digits 1 through 9.at n=10A294661
• Numbers X such that X^2 + Y^2 = 3^(2*k) + 1 and X > Y > 0 and k is the ternary digit length of X-1.at n=18A369768
• Numbers k such that any two consecutive decimal digits of k^2 differ by 1 after arranging the digits in decreasing order.at n=43A370362