280182

Appears in sequences

• Successive approximations to 5-adic integer sqrt(-1).at n=8A034935
• a(n) is smallest number such that a(n)^2 + 1 is divisible by 5^n.at n=9A034939
• One of the two successive approximations up to 5^n for the 5-adic integer sqrt(-1).at n=8A048898
• One of the two successive approximations up to 5^n for the 5-adic integer sqrt(-1).at n=9A048898
• Smallest k such that k^2+1 is divisible by A002144(n)^9.at n=0A145873
• Numbers k such that k^2 + 1 is divisible by a 7th power.at n=7A218574
• Table T(k, n) of smallest bases b > 1 such that p = prime(n) satisfies b^(p-1) == 1 (mod p^k), read by antidiagonals.at n=52A257833
• a(n) is the unique even-valued residue modulo 5^n of a number m such that m^2+1 is divisible by 5^n.at n=7A258929
• a(n) is the unique even-valued residue modulo 5^n of a number m such that m^2+1 is divisible by 5^n.at n=8A258929
• a(n) is the least k such that A051903(k^2+1) = n.at n=8A274721
• Minimum m coprime to 5 such that the convergence speed of m^^m := m^(m^^(m-1)) is equal to n >= 0, where A317905(n) represents the convergence speed of m^^m (and m = A047201(n), the n-th non-multiple of 5).at n=9A337833
• a(n) is the smallest base of the form 2 + 10*k which is characterized by a convergence speed of n, where A317905(n) represents the convergence speed of m^^m.at n=8A340345
• Smallest b > 1 such that b^(p-1) == 1 (mod p^9) for p = prime(n).at n=2A353942
• Smallest nonnegative integer coprime to 5 with a constant congruence speed >= n (see A373387 for the definition of "constant congruence speed").at n=8A387665
• Smallest nonnegative integer coprime to 5 with a constant congruence speed >= n (see A373387 for the definition of "constant congruence speed").at n=9A387665