24022

Appears in sequences

• Expansion of log(1+log(1+x))/cos(x).at n=7A009316
• a(n)=a(n-1)+a(n-2)-d, where d=a(n/5) if 5 divides n, else d=0; 2 initial terms.at n=22A050195
• Numbers k such that 3*10^k + 1*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=18A056704
• Number of zero-bit dominant primes (A095071) in range ]2^n,2^(n+1)].at n=19A095019
• Number of primes with number of 1-bits <= number of 0-bits (A095075) in range ]2^n,2^(n+1)].at n=19A095055
• Number of perfect powers (A001597) < 2^n.at n=29A188951
• a(1) = a(2) = 2; a(n) = a(n-1) + gpf(a(n-2)), where gpf is greatest prime factor.at n=43A258125
• Numbers b_n of Fibonacci-quilt legal decompositions of n.at n=35A289432
• Expansion of Product_{n>=1} ((1 + 4*x^n)/(1 - 4*x^n))^(1/4).at n=9A303360
• a(n) is the least number such that the n-th prime is the least coprime quadratic nonresidue modulo a(n).at n=10A306493