A097588 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A097588

a(n)=floor(P(k)/P(n)) with P(k)=lesser Fortunate numbers for P(n)# (A055211).

1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2

(list; graph; refs; listen; history; text; internal format)

OFFSET

2,10

COMMENTS

Conjecture : a(n) is always < 8.

LINKS

Pierre CAMI, Table of n, a(n) for n = 2..2000

EXAMPLE

a(11) = floor(73/31) = 2, A055211(11) = 73 prime(11) = 31,

2*3*5*7*11*13*17*19*23*29*31-73 is prime and 73 is the smallest odd number k such that p(11)# - k is prime.

CROSSREFS

Cf. A055211.