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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A073939 Least m such that A078142(m) gives the n-th prime, where A078142(n) is the sum of the differences of the distinct prime factors p of n and the next square larger than p. 1

%I #10 Dec 08 2019 12:24:20

%S 2,6,11,22,53,106,83,166,173,227,293,863,443,857,853,971,1097,2194,

%T 1229,1373,2746,2837,2221,2027,2819,3499,4253,3257,3491,3251,4229,

%U 4493,5639,6917,6907,7949,6899,7937,7229,7927,11057,10223,9413,10211,9803

%N Least m such that A078142(m) gives the n-th prime, where A078142(n) is the sum of the differences of the distinct prime factors p of n and the next square larger than p.

%H Amiram Eldar, <a href="/A073939/b073939.txt">Table of n, a(n) for n = 1..10000</a>

%e a(4)=22 because A078142(22)=7, the fourth prime and this is the first time 7 occurs.

%t s[n_] := Total[Ceiling[Sqrt[(p = FactorInteger[n][[;; , 1]])]]^2 - p]; max=45; seq=Table[0,{max}]; c = 0; n=1; While[c<max, s1=s[n]; If[PrimeQ[s1], i=PrimePi[s1]; If[i<=max && seq[[i]]==0, c++; seq[[i]] = n]]; n++]; seq (* _Amiram Eldar_, Dec 08 2019 *)

%Y Cf. A078142.

%K nonn

%O 1,1

%A _Jason Earls_, Nov 20 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 1 22:42 EDT 2024. Contains 372178 sequences. (Running on oeis4.)