34016
domain: N
Appears in sequences
- a(n) = number of integer strings s(0),...,s(n) counted by array T in A026374 that have s(n)=1; also a(n) = T(2n-1,n-1).at n=7A026378
- a(n) = T(n,[ n/2 ]), where T is the array in A026374.at n=14A026380
- T(n,[ n/2 ]), where T is the array in A026386.at n=14A026392
- Numbers n such that n^1024 + 1 is prime (a generalized Fermat prime).at n=36A057002
- Numbers n such that (10^(2n+1)+72*10^n-1)/9 is prime.at n=7A107649
- Binomial matrix applied to A111418.at n=28A126791
- Numbers k such that 6*p(k)*p(k+1)*p(k+2)*p(k+3)*p(k+4)*(k+5)*p(k+6)-1 and 6*p(k)*p(k+1)*p(k+2)*p(k+3)*p(k+4)*(k+5)*p(k+6)+1 are twin primes with p(h) = h-th prime.at n=22A129313
- Square array A(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of e.g.f. exp(k*x)*(BesselI(0,2*x) + BesselI(1,2*x)).at n=62A292630