23165

Appears in sequences

• Let b(1)=b(2)=1, b(k) = (2^b(k-1)+2^b(k-2)) (mod k); sequence gives values of n such that b(n)=0.at n=41A074782
• Fourth binomial transform of F(n+1).at n=6A081569
• Square array of binomial transforms of Fibonacci numbers, read by ascending antidiagonals.at n=61A081572
• Numbers 41*k such that 41*k+2 and 41*k-6 are both prime.at n=7A153822
• Numbers k such that 3k-4, 3k-2, 3k+2, and 3k+4 are primes.at n=29A173092
• Numbers n such that both n*Pi and n*e are within 1/sqrt(n) of integers.at n=40A208530
• Expansion of Product_{k>=1} 1/(1 - Sum_{j=1..k} x^(j*k)).at n=27A319758
• Numbers m such that m^2+1 is semiprime with (m-1)^2+1 and (m+1)^2+1 primes.at n=40A321985