|
%I #10 Aug 18 2017 19:23:44
%S 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,
%T 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,
%U 1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,2
%N a(n)=floor(P(k)/P(n)) with P(k)=lesser Fortunate numbers for P(n)# (A055211).
%C Conjecture : a(n) is always < 8.
%H Pierre CAMI, <a href="/A097588/b097588.txt">Table of n, a(n) for n = 2..2000</a>
%e a(11) = floor(73/31) = 2, A055211(11) = 73 prime(11) = 31,
%e 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.
%Y Cf. A055211.
%K base,nonn
%O 2,10
%A _Pierre CAMI_, Aug 29 2004
|
