110734

Appears in sequences

• Least k such that gcd(prime(k+1)-1, prime(k)-1) = 2n.at n=42A067605
• Lower triangular matrix T, read by rows, such that the row sums of T^n form the (2n)-dimensional partition numbers.at n=82A096652
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (0, 0, 1), (1, -1, -1), (1, 1, 1)}.at n=9A150357
• Sum of piles of first n primes: a(n) = Sum(prime(i)*(2*i-1): 1<=i<=n).at n=34A316322
• Triangle read by rows: T(n,k) is the number of simple connected graphs on n nodes with k peripheral nodes.at n=52A324244