19895

Appears in sequences

• Trajectory of n under the Reverse and Add! operation carried out in base 3 (presumably) does not reach a palindrome and (presumably) does not join the trajectory of any term m < n.at n=41A077405
• Pseudo-random numbers: MS C 6.0 version.at n=29A084275
• Integers arising in A133677.at n=21A133645
• A triangular sequence of coefficients of polynomials: p(x,n) = (2*(x - 1)^n * (Sum_{k>=0} (((-1)^n*(2*k + 1)^(n - 1)))*x^k) - (x - 1)^(n + 1)*(Sum_{k>=0} ((-1)^(n + 1)*k^n)*x^k)/x).at n=23A154335
• A triangular sequence of coefficients of polynomials: p(x,n) = (2*(x - 1)^n * (Sum_{k>=0} (((-1)^n*(2*k + 1)^(n - 1)))*x^k) - (x - 1)^(n + 1)*(Sum_{k>=0} ((-1)^(n + 1)*k^n)*x^k)/x).at n=25A154335
• Partial sums of A160414.at n=27A161325
• Multiples of 23 whose digit reversal + 1 is also a multiple of 23.at n=36A166393
• Numbers m such that psi(x) = phi(m) has a solution while sigma(y) = phi(m) has none.at n=22A291524
• On a diagonally numbered square grid, with labels starting at 1, this is the number of steps that a (1,n) leaper makes before getting trapped when moving to the lowest available unvisited square, or -1 if it never gets trapped.at n=36A352730
• Antidiagonal sums of A343052.at n=48A379703
• Odd multiplicative orders of 2+-i modulo primes p == 3 (mod 4).at n=3A385217
• Multiplicative orders of 2+-i modulo p == 3 (mod 4) that are not divisible by 2 or 3.at n=1A385219