30594

Appears in sequences

• Smallest of first string of exactly 2n-1 consecutive composite integers.at n=18A045881
• Numbers k such that x^k + x^3 + 1 is irreducible over GF(2).at n=41A057461
• 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, 0), (0, -1, 1), (0, 1, 0), (1, -1, -1)}.at n=12A148030
• Number of 2Xn 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=15A240154
• Least number k such that k^n +- k +- 1 is prime for all four possibilities, or 0 if no such k exists.at n=4A248031
• a(n) is the smallest positive integer that begins a run of exactly 2*n-1 consecutive integers having at least 4 divisors each.at n=18A340735
• Numbers m > 3 such that x^m + x^3 + 1 is irreducible over GF(2) while x^m + x^3 + x^2 + x + 1 = x^m + (x + 1)^3 is not.at n=8A344177
• Irregular table read by rows: T(n,k) is the number of k-gons, k>=2, among all distinct circles that can be constructed from the 3 vertices and the equally spaced 3*n points placed on the sides of an equilateral triangle when every pair of the 3 + 3*n points are connected by a circle and where the points lie at the ends of the circle's diameter.at n=59A372734