28738

Appears in sequences

• Numbers whose base-13 representation has exactly 5 runs.at n=7A043660
• Numerators of convergents to log_2(10).at n=8A073733
• Related to the minimal number of periodic orbits of periods guaranteed by Sharkovskii's theorem.at n=37A130628
• 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, 1), (0, 0, 1), (0, 1, -1), (1, 0, 1)}.at n=8A150411
• Number of nX1 0..3 arrays with every element value z a city block distance of exactly z from another element value z.at n=12A209173
• Least number k such that the number of iterations of h(m) = (greatest prime divisor of m) - (least prime divisor of m) that map k to 0 is n; see Comments.at n=8A233510
• Take a squarefree semiprime and take the difference between its prime factors. If this difference is a squarefree semiprime repeat the process. Sequence lists the smallest squarefree semiprime that generates other squarefree semiprimes in the first n steps of this process.at n=7A296808
• Take a squarefree semiprime and take the difference of its prime factors. If it is a squarefree semiprime repeat the process. Sequence lists the squarefree semiprimes that generate other squarefree semiprimes only in the first k steps of this process. Case k = 5.at n=13A296812
• Take a squarefree semiprime and take the difference of its prime factors. If it is a squarefree semiprime repeat the process. Sequence lists the squarefree semiprimes that generate other squarefree semiprimes only in the first k steps of this process. Case k = 6.at n=3A296813
• Take a squarefree semiprime and take the difference of its prime factors. If it is a squarefree semiprime repeat the process. Sequence lists the squarefree semiprimes that generate other squarefree semiprimes only in the first k steps of this process. Case k = 7.at n=0A296814
• Positive numbers k at which min{abs(2^k - 10^y)/10^y: y in Z} reaches a new minimum.at n=9A333332