19593

Appears in sequences

• Let A(n) = #{(i,j): i^2 + j^2 <= n}, V(n) = Pi*n, P(n) = A(n) - V(n); sequence gives values of n where |P(n)| sets a new record.at n=39A000099
• a(n) = (2*n+1)*(10*n+1).at n=31A033574
• Number of primes == 9 (mod 10) less than 10^n.at n=5A073508
• a(n) is the least positive integer such that nextprime(a(n)^n) - prevprime(a(n)^n) = 4.at n=21A090125
• a(n) = n*(4*n^2+5*n-3)/2.at n=20A126335
• a(n) = 49*n^2 - 7.at n=19A158484
• Number of (n+1) X 2 0..2 arrays with every 2 X 2 subblock sum greater than 4.at n=4A184489
• Number of (n+1)X6 0..2 arrays with every 2X2 subblock sum greater than 4.at n=0A184493
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock sum greater than 4.at n=10A184497
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock sum greater than 4.at n=14A184497
• Number of partitions of n with difference -9 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=51A242683
• Triangle read by rows: T(n,r), 0 <= r <= n, is the number of idempotents of rank r in the twisted planar partition monoid PP_n^tau.at n=22A289620
• Least k such that there are exactly n ways to choose a sequence of divisors, one of each element of the multiset of prime indices of k (with multiplicity).at n=46A355732
• Number of distinct lines passing through exactly two points in a triangular grid of side n.at n=25A362014
• Consecutive states of the linear congruential pseudo-random number generator for 16-bit WATFOR/WATFIV when started at 1.at n=34A384158