89951

Appears in sequences

• a(n) = T(2*n, n+2), T given by A027011.at n=7A027013
• Partial sums of A027964.at n=13A053298
• Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 01000-11111-01000 pattern in any orientation.at n=17A147025
• a(n) = (10*n+3)*(10*n+17).at n=29A152579
• Number of 3Xn 0..3 arrays with no element equal to zero plus the sum of elements to its left or zero plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=11A240048
• Numbers that are both a sum and a product of two or more consecutive primes.at n=33A254859
• Sequence of pairwise relatively prime numbers of class P_3 (see comment).at n=31A275246
• After the initial 1, numbers k such that A347381 obtains its minimum value at k, of all the divisors d of k larger than one, where A347381 is the distance from n to the nearest common ancestor of n and sigma(n) in the Doudna-tree (A005940).at n=34A374218
• Composite numbers k such that A347381 obtains the same value for all divisors of k that are larger than one, where A347381 is the distance from n to the nearest common ancestor of n and sigma(n) in the Doudna-tree (A005940).at n=14A374219