19712

Appears in sequences

• a(n) = 12^n - n^5.at n=4A024145
• Number of ways to place a non-attacking white and black knight on n X n chessboard.at n=11A035289
• Number of nonprimes <= prime(n)^2.at n=34A053683
• Let f(n) = fraction of digits that are nonzero when n is written in base 2 and g(n) the same fraction for base 3. Let h(n) = max {f(n), g(n)}. Sequence gives n for which h(n) sets a new low record.at n=7A078415
• Triangle of coefficients in expansion of sinh^2(n*x) in powers of sinh(x).at n=23A082649
• a(n) = 2*a(n-1) - 6*a(n-2), a(0)=0, a(1)=1.at n=12A088139
• a(n) = C(2n-1,n-1) mod n^3.at n=29A099907
• Triangle read by rows: T(n,k) is number of noncrossing trees with n edges and having k nonroot nodes of degree 1.at n=41A101449
• Triangle read by rows: T(n,k) is number of noncrossing trees with n edges and having k branches.at n=39A101452
• Triangle read by rows: T(n,k) is the number of Grand Dyck paths of semilength n and having k returns to the x-axis.at n=51A108747
• Triangle T(n,k) = k*A053120(n,k).at n=61A136160
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (0, 1, -1), (0, 1, 0), (0, 1, 1), (1, 0, 1)}.at n=7A151139
• Numbers of the form p^8*q*r where p, q, and r are distinct primes.at n=10A179747
• Table of coefficients of a polynomial sequence related to the Springer numbers.at n=42A185417
• a(n) = Product_{k>=1} floor(n^(1/k)).at n=76A190668
• Number of (n+2) X 4 binary arrays avoiding patterns 000 and 011 in rows, columns and nw-to-se diagonals.at n=6A202771
• Number of (n+2)X9 binary arrays avoiding patterns 000 and 011 in rows, columns and nw-to-se diagonals.at n=1A202776
• T(n,k) = Number of (n+2) X (k+2) binary arrays avoiding patterns 000 and 011 in rows, columns and nw-to-se diagonals.at n=34A202777
• T(n,k) = Number of (n+2) X (k+2) binary arrays avoiding patterns 000 and 011 in rows, columns and nw-to-se diagonals.at n=29A202777
• Even numbers in A221715.at n=29A213218