cp's OEIS Frontend

A234299 a(n) = |A| is the smallest order of a set A of consecutive integers which has Euler-phi(3*5*7*11*...*Pn) members coprime to 3*5*7*..*Pn, where Pn is the n-th odd prime.

%I A234299 #35 Nov 25 2024 12:40:20
%S A234299 2,13,101,1149,15005,255243,4849829,111546416,3234846593,100280245037,
%T A234299 3710369067373,152125131763569,6541380665834971,307444891294245656,
%U A234299 16294579238595022313,961380175077106319477,58644190679703485491570,3929160775540133527939470
%N A234299 a(n) = |A| is the smallest order of a set A of consecutive integers which has Euler-phi(3*5*7*11*...*Pn) members coprime to 3*5*7*..*Pn, where Pn is the n-th odd prime.
%C A234299 The sequence is strongly associated with A072752.
%C A234299 In A072752, you are looking for a maximum sized set of consecutive numbers where none are counted by Euler's phi(3*5*7*...*Pn); this sequence looks for a minimum sized set of consecutive numbers where all the numbers counted by Euler are included.
%C A234299 One candidate for A (not necessarily of minimum size) is the set {1, 2, 3,..., 3*5*..*Pn}, which has the requested number of coprime elements. This yields the simple upper bound a(n) <= A070826(n+1). - _R. J. Mathar_, May 03 2017
%F A234299 Let A = { set of any k consecutive integers}, |A| its size.
%F A234299 Let B = {x IN A | gcd(x, 3*5*7...Prime(n))=1}.
%F A234299 Condition: |B| = phi(3*5*7...Prime(n))= A005867(n+1).
%F A234299 a(n) = minimum(|A|) which meets the above condition.
%F A234299 a(n) = A070826(n+1) - A072752(n+1).
%e A234299 a(1)=2,  phi(3) = 2, A={1,2 }, B={1,2}, |B|=2  gcd(1,3) = 1; gcd(2,3) = 1; minimum(|A|) = 2.
%e A234299 a(2)=13, phi(3*5) = 8, A={7,8,9,10,...,19}, B={7, 8, 11, 13, 14, 16, 17, 19}, |B|=8, A was chosen so |A| is a minimum.
%Y A234299 Cf. A005867, A070826, A072752.
%K A234299 hard,nonn
%O A234299 1,1
%A A234299 _John F. Morack_, Dec 22 2013
%E A234299 Edited by _R. J. Mathar_, May 03 2017