24929

Appears in sequences

• Strong pseudoprimes to base 8.at n=18A020234
• Strong pseudoprimes to base 30.at n=16A020256
• Strong pseudoprimes to base 34.at n=16A020260
• Numbers k such that the continued fraction for sqrt(k) has period 67.at n=27A020406
• Smallest term x from A066669 such that phi(x) = 2^n times some prime.at n=12A066673
• Number of ordered finite sequences a_1 <= a_2 <= ... <= a_n of length n of positive integers less than or equal to n whose product is n!.at n=18A120690
• Number of ordered finite sequences a_1 <= a_2 <= ... <= a_n of length n of positive integers less than or equal to n whose product is n!.at n=19A120690
• 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, 1), (1, -1, 1)}.at n=9A148897
• 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, 1, 0), (0, 1, -1), (1, -1, 0), (1, 1, 1)}.at n=8A149712
• Number of nX3 1..5 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in increasing order.at n=3A166821
• Smallest k<3*2^n such that 3*2^n+k is the smallest of four consecutive primes in arithmetic progression or 0 if no solution.at n=29A230852
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 473", based on the 5-celled von Neumann neighborhood.at n=32A272425
• Composite numbers n such that 2^lpf(n) == 2 (mod n), where lpf(n) = A020639(n).at n=26A276733