A376807 Products of distinct prime Fibonacci numbers.

1, 2, 3, 5, 6, 10, 13, 15, 26, 30, 39, 65, 78, 89, 130, 178, 195, 233, 267, 390, 445, 466, 534, 699, 890, 1157, 1165, 1335, 1398, 1597, 2314, 2330, 2670, 3029, 3194, 3471, 3495, 4791, 5785, 6058, 6942, 6990, 7985, 9087, 9582, 11570, 15145, 15970, 17355, 18174

Offset

1,2

Comments

Each term is a product of a finite subsequence of A005478.

Links

Table of n, a(n) for n=1..50.

Prog

(Python)
import itertools, math, sympy
def fibprimegen(limit):  # Generate Fibonacci primes <= limit
  a, b = 1, 2
  while b <= limit:
    if sympy.isprime(b):
      yield b
    a, b = b, a+b
LIMIT=1000000
fibprimes=list(fibprimegen(LIMIT))
fibprimeseqs=itertools.chain.from_iterable(
    itertools.combinations(fibprimes, n) for n in range(len(fibprimes)+1))
print(sorted(a for a in map(math.prod, fibprimeseqs) if a <= LIMIT))

Crossrefs

Cf. A005478, A160009.

Sequence in context: A250179 A202823 A013931 * A018429 A341125 A035953

Adjacent sequences: A376804 A376805 A376806 * A376808 A376809 A376810

Keyword

nonn,easy

Author

Jack Brennen, Oct 04 2024

Status

approved