84050
domain: N
Appears in sequences
- Positive integers n such that n | (2^n + n/2 + 1).at n=14A015945
- Numbers that are the sum of 2 nonzero squares in exactly 5 ways.at n=32A025288
- Numbers k such that 7^k - 2 is a prime.at n=28A090669
- Numbers n that are the hypotenuse of exactly 12 distinct integer-sided right triangles, i.e., n^2 can be written as a sum of two squares in 12 ways.at n=31A097226
- 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, 1), (-1, 0, 1), (0, 1, -1), (1, -1, -1), (1, 0, 0)}.at n=12A148084
- Numbers n such that phi(n)/n = 16/41.at n=22A176598
- Numbers k such that sigma(k) + tau(k) + phi(k) is a prime, where sigma(k) = A000203(k), tau(k) = A000005(k) and phi(k) = A000010(k).at n=18A229265
- Number of (n+2)X(4+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000101 00010101 or 01010101.at n=5A260011
- Number of (n+2)X(6+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000101 00010101 or 01010101.at n=3A260013
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000101 00010101 or 01010101.at n=39A260015
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000101 00010101 or 01010101.at n=41A260015