130200

Appears in sequences

• Numbers k such that 2*25^k - 1 is prime.at n=16A002958
• Numbers k such that (k-1, k+1) and (k/2-1, k/2+1) are both pairs of twin primes.at n=18A076504
• Numbers that can be expressed as the difference of the squares of primes in exactly ten distinct ways.at n=8A092006
• Convolution of 4^n*n! and n!.at n=5A110467
• Number of binary strings of length n such that there exist three consecutive digits where at least two of them are 1's.at n=17A118645
• Triangle read by rows: T(n,k) is the number of partial bijections (or subpermutations) of an n-element set of height k (height(alpha) = |Im(alpha)|) and with exactly 1 fixed point.at n=32A144090
• Places n such that the two remainders A187680(n) and A191906(n) are both zero.at n=32A192853
• Number of ordered triples (w,x,y) with all terms in {-n,...-1,1,...,n} and w+2x+2y>0.at n=32A211624
• Coefficients of mock modular form H_2^(4) (divided by 2).at n=19A256052
• Number T(n,k) of ordered partitions of an n-set with nondecreasing block sizes and maximal block size equal to k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=48A262071
• Number of ordered set partitions of [n] with nondecreasing block sizes and maximal block size equal to three.at n=6A272493
• "Full Inside numbers". Such numbers have the property that all their digits will be visited exactly once in a single closed circuit (see Comments).at n=5A284591
• p-INVERT of the primes (A000040), where p(S) = 1 - S - S^2.at n=7A289847
• a(n) is the least x such that x-1 and x+1 are prime and there are exactly n primes of the form x-1+t or x+1+t where t divides x.at n=40A340170
• Numbers k such that the sum of the squares of the odd divisors of k (A050999) is divisible by k.at n=31A355543
• Number of ways to place a non-attacking black king and white king on an n X n board, up to rotation and reflection.at n=32A357723