30765

Appears in sequences

• a(n) is the least positive integer k such that g(k) = n*g(k-1), where g(k) = prime(k+1) - prime(k).at n=35A078563
• Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 0111-1100-0111 pattern in any orientation.at n=16A147374
• Number of (w,x,y,z) with all terms in {1,...,n} and 2*w*x<3*y*z.at n=15A211920
• G.f.: Sum_{n>=0} (2 + (1+x)^n)^n / (3 + (1+x)^n)^(n+1).at n=5A302614
• Position of second appearance of 2n in the sequence of prime gaps A001223; if 2n does not appear at least twice, a(n) = -1.at n=35A356221