19654

Appears in sequences

• a(0) = 1, a(n) = 17*n^2 + 2 for n>0.at n=34A010007
• Smallest a(n)>2 such that all integers strictly between a(n)-n and a(n) are composite.at n=44A075741
• Number of primes of the form 12k + 11 less than 10^n.at n=5A091164
• Number of 1..27 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1.at n=2A171301
• Number of 1..n integer arrays v[1..3] of length 3 with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..2.at n=26A171340
• Numbers n such that A234519(n) = n.at n=46A234524
• Number of (n+1)X(2+1) 0..2 arrays with every 2X2 subblock summing to a prime.at n=2A251404
• Number of (n+1)X(3+1) 0..2 arrays with every 2X2 subblock summing to a prime.at n=1A251405
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock summing to a prime.at n=7A251410
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock summing to a prime.at n=8A251410
• Where record values occur in A276781, when starting from A276781(2)=1.at n=45A276782
• a(n) is the smallest integer k > n such that (k+1)(k+2)...(2k-2n+1)/(k(k-1)...(k-n+1)) is an integer.at n=44A290791