31589

Appears in sequences

• Increasing sequence with no repeating digits and no digits shared with previous term.at n=31A054659
• Reverse of smallest prime factor of k = largest prime factor of k+1; a(1)=1.at n=25A071392
• Write down the numbers from 3 to infinity. Take next number, M say, that has not been crossed off. Counting through the numbers that have not yet been crossed off after that M, cross off every 5th term. Repeat, always crossing off every 5th term of those that remain. The numbers that are left form the sequence.at n=42A100586
• 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, 0, 0), (0, -1, 0), (0, 0, -1), (0, 0, 1), (1, 1, 0)}.at n=8A150471
• n such that A205592(n) > n.at n=18A205594
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 141", based on the 5-celled von Neumann neighborhood.at n=35A270284
• a(n) is the smallest composite squarefree number k such that (p+n) | (k+1) for all primes dividing k.at n=33A274446
• Numbers k such that 33*10^k + 7 is prime.at n=28A275285