19204

Appears in sequences

• No-3-in-line problem: number of inequivalent ways of placing 2n points on an n X n grid so that no 3 are in a line.at n=17A000769
• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 98 ones.at n=16A031866
• a(n) = sum of n-th column in array in A100452.at n=27A100454
• Number of times that the numerator of a sum generated from the set 1, 1/2, 1/3,..., 1/n is a Fibonacci number.at n=28A256220
• Number of (n+1) X (2+1) arrays of permutations of 0..n*3+2 with each element having directed index change 0,1 0,-1 0,2 1,0 -1,0 or 2,0.at n=4A264159
• Number of (n+1)X(5+1) arrays of permutations of 0..n*6+5 with each element having directed index change 0,1 0,-1 0,2 1,0 -1,0 or 2,0.at n=1A264162
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,1 0,-1 0,2 1,0 -1,0 or 2,0.at n=16A264163
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,1 0,-1 0,2 1,0 -1,0 or 2,0.at n=19A264163
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 449", based on the 5-celled von Neumann neighborhood.at n=31A272254
• a(n) = smallest k such that li(k) - pi(k) >= n, where li(k) is the logarithmic integral and pi(x) is the number of primes <= x.at n=31A359145