cp's OEIS Frontend

A376807 Products of distinct prime Fibonacci numbers.

%I A376807 #12 Oct 05 2024 10:59:28
%S A376807 1,2,3,5,6,10,13,15,26,30,39,65,78,89,130,178,195,233,267,390,445,466,
%T A376807 534,699,890,1157,1165,1335,1398,1597,2314,2330,2670,3029,3194,3471,
%U A376807 3495,4791,5785,6058,6942,6990,7985,9087,9582,11570,15145,15970,17355,18174
%N A376807 Products of distinct prime Fibonacci numbers.
%C A376807 Each term is a product of a finite subsequence of A005478.
%o A376807 (Python)
%o A376807 import itertools, math, sympy
%o A376807 def fibprimegen(limit):  # Generate Fibonacci primes <= limit
%o A376807   a,b = 1,2
%o A376807   while b <= limit:
%o A376807     if sympy.isprime(b):
%o A376807       yield b
%o A376807     a,b = b,a+b
%o A376807 LIMIT=1000000
%o A376807 fibprimes=list(fibprimegen(LIMIT))
%o A376807 fibprimeseqs=itertools.chain.from_iterable(
%o A376807     itertools.combinations(fibprimes,n) for n in range(len(fibprimes)+1))
%o A376807 print(sorted(a for a in map(math.prod,fibprimeseqs) if a <= LIMIT))
%Y A376807 Cf. A005478, A160009.
%K A376807 nonn,easy
%O A376807 1,2
%A A376807 _Jack Brennen_, Oct 04 2024