40958

Appears in sequences

• a(n) = 5*2^n - 2.at n=13A051633
• n*10^3-1, n*10^3-3, n*10^3-7 and n*10^3-9 are all prime.at n=22A064977
• Start with 1, then alternately add 2 or double.at n=27A123208
• a(n) = 5*2^(n-2) - 2 for n > 1, with a(1) = 1.at n=14A131051
• Row sums of triangle A134061.at n=13A134062
• Numbers k such that 7*R_k + 3*10^k - 4 is prime, where R_k = 11...11 is the repunit (A002275) of length k.at n=14A259125
• Start at a(0)=1. a(n) = a(n-1)+2 if n == 1,2 (mod 3) and a(n)=a(n-1)+a(n-3) if n == 0 (mod 3).at n=40A268896
• Numbers whose derivative is equal to the arithmetic derivative.at n=34A273993
• a(n) is the smallest even number not congruent to 1 modulo 3 that starts a (2n+1)-element alternating sequence of x/2 and (3x+1) iterations ending in the maximum of its Collatz trajectory.at n=12A277215
• Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 565", based on the 5-celled von Neumann neighborhood.at n=15A283059
• a(n) = N^(1/4) * log(N) / sqrt(log(log(N))) rounded to nearest integer, with N=2^n. Related to operation count of the deterministic factorization of an integer N using an improved Pollard-Strassen method.at n=43A309916
• Convolution of A000219 and A001477.at n=16A360489