20799
domain: N
Appears in sequences
- Numbers k such that sigma(k-3) + sigma(k+3) = sigma(2*k).at n=22A067129
- Number of graphical partitions of simple Eulerian graphs (partitions given by the degrees of vertices of simple (no loops or multiple edges) graphs having only vertices of even degrees) having n edges.at n=49A069831
- Integers k such that nextprime(k^5) - prevprime(k^5) = 4.at n=18A090123
- Related to enumeration of rooted catapolyoctagons (see Cyvin reference for precise definition).at n=11A121118
- Integers k such that 10^k + 61 is a prime number.at n=16A135116
- 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), (0, 1, 0), (1, -1, 0)}.at n=9A149864
- a(n) = 52*n^2 - 1.at n=19A158640
- a(n) = A242107(n+1) * A242107(n-1) * (1 + mod(n,2)).at n=20A244373
- Number of 3 X 3 matrices with unit determinant and nonnegative integer entries whose sum is n.at n=19A361083
- a(n) is the least positive number k such that n is the greatest m such that k is a quadratic residue mod prime(i) for i=1..m and {k mod prime(i): i=1..m} are all distinct.at n=6A385050