17936

Appears in sequences

• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 13 ones.at n=33A031781
• Number of basic interval orders of length n.at n=6A049463
• Number of maximally clustered permutations in S_n; the maximally clustered permutations are those that avoid 3421, 4312 and 4321.at n=9A129775
• a(n) = 512n + 16.at n=34A157475
• Number of binary strings of length n with equal numbers of 00001 and 00101 substrings.at n=15A164195
• Number of (w,x,y,z) with all terms in {1,...,n} and |w-x|=w+|y-z|.at n=38A212685
• Sum of the squared parts of the partitions of n into exactly two parts.at n=37A226141
• a(n) = Sum_{i=0..n} digsum_9(i)^3, where digsum_9(i) = A053830(i).at n=48A231686
• Duplicate of A129775.at n=9A235391
• Number of n X n 0..4 arrays with the absolute differences of each element with its with horizontal and antidiagonal neighbors unique.at n=2A265921
• Number of n X 3 0..4 arrays with the absolute differences of each element with its with horizontal and antidiagonal neighbors unique.at n=2A265923
• T(n,k)=Number of nXk 0..4 arrays with the absolute differences of each element with its with horizontal and antidiagonal neighbors unique.at n=12A265928
• Number of 3Xn 0..4 arrays with the absolute differences of each element with its with horizontal and antidiagonal neighbors unique.at n=2A265931
• Numbers which are representable as a sum of nineteen but no fewer consecutive nonnegative integers.at n=18A270303
• Number of cyclic subgroups of the group C_n x C_n x C_n x C_n, where C_n is the cyclic group of order n.at n=17A280184
• Numbers k such that (13*10^k - 43)/3 is prime.at n=19A290962
• Partial sums of A299277.at n=26A299278
• Total number of graceful labelings of the n-ladder graph.at n=4A333719
• Array read by antidiagonals: T(n,k) (n>=1, k>=1) = number of ways to select four points from an n X k grid so that three of them form a triangle of nonzero area and the extra point is strictly inside the triangle.at n=70A334709
• Array read by antidiagonals: T(n,k) (n>=1, k>=1) = number of ways to select four points from an n X k grid so that three of them form a triangle of nonzero area and the extra point is strictly inside the triangle.at n=73A334709