35765

Appears in sequences

• Sum of terms in n-th row of A077316.at n=22A077318
• Start with Pascal's triangle; form a rhombus by sliding down n steps from top on both sides then sliding down inwards to complete the rhombus and then deleting the inner numbers; a(n) = sum of entries on perimeter of rhombus.at n=8A081495
• Number of (n+2) X (n+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00000000 00000001 or 00000101.at n=3A259944
• Number of (n+2)X(4+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00000101.at n=3A259948
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00000101.at n=24A259952
• Numbers k such that k![4] - 32 is prime, where k![4] = A007662(k) = quadruple factorial.at n=30A329167
• Numbers k such that there are exactly four biquadratefree powerful numbers (A338325) between k^2 and (k+1)^2.at n=34A338391