26391

Appears in sequences

• a(n) = 10000*log(n) rounded to nearest integer.at n=13A004244
• a(n) = ceiling(10000*log(n)).at n=13A004245
• an=n-th smallest integer m=p1*p2*p3, product of 3 odd primes such that d+2m/d are all primes for d dividing 2m.at n=18A128278
• Numerators b(n) of Pythagorean approximations b(n)/a(n) to 1/4.at n=7A195563
• G.f.: A(x) = exp( Sum_{n>=1} (Sum_{k=0..2*n} A027907(n,k)^2 * x^k / A(x)^k) * x^n/n ).at n=19A200377
• a(0) = 16, after which, if (2*a(n-1)) - 1 = product_{k >= 1} (p_k)^(c_k) then a(n) = product_{k >= 1} (p_{k-1})^(c_k), where p_k indicates the k-th prime, A000040(k).at n=27A246345
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 323", based on the 5-celled von Neumann neighborhood.at n=34A271255
• Sum of the largest parts in the partitions of n into 8 parts.at n=37A308998
• Non-Brauer numbers.at n=13A349044