27001

Appears in sequences

• a(n) = n^3 + 1.at n=31A001093
• Strong pseudoprimes to base 30.at n=18A020256
• Decimal part of cube root of a(n) starts with 0: first term of runs (cubes excluded).at n=28A034126
• Numerators of continued fraction convergents to sqrt(574).at n=4A042100
• Numbers k such that k^14 == 1 (mod 15^3).at n=32A056087
• Smallest number of the form n^k +1 with the prime signature of n, or 0 if no such number exists.at n=29A087318
• Smallest number of the form n^k +1, with tau(a(n)) = tau(n), or 0 if no such number exists.at n=29A087319
• Numbers k such that k + sigma(k) + phi(k) is a square.at n=34A116009
• 288*n^2 - 168*n - 119.at n=9A118059
• a(n) = n^3 if n is odd, n^3 + 1 otherwise.at n=30A129957
• a(n) = 900*n + 1.at n=29A158407
• a(n) = 30*n^2 + 1.at n=30A158558
• Coefficient of x in the reduction by x^2->x+1 of the polynomial p(n,x) defined below in Comments.at n=17A192747
• Zeisel numbers with p(0)=4.at n=4A200525
• Hilltop maps: number of n X 2 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or vertical neighbor in a random 0..1 nX2 array.at n=7A218348
• T(n,k) = Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or vertical neighbor in a random 0..1 n X k array.at n=37A218354
• T(n,k) = Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or vertical neighbor in a random 0..1 n X k array.at n=43A218354
• T(n,k)=Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, diagonal or antidiagonal neighbor in a random 0..1 nXk array.at n=43A219078
• A239461(n) / n^2.at n=26A239464
• 60-gonal (hexacontagonal) numbers: a(n) = n(29n - 28).at n=31A249911