This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A296375 Least x such that sigma(x) = prime(n)+1, where sigma = A000203. 2
 2, 3, 5, 7, 6, 13, 10, 19, 14, 29, 21, 37, 20, 43, 33, 34, 24, 61, 67, 30, 73, 57, 44, 40, 52, 101, 63, 85, 109, 74, 93, 86, 137, 76, 149, 111, 157, 163, 60, 173, 88, 117, 105, 193, 197, 199, 211, 84, 147, 229, 90, 114, 241, 96, 257, 215, 136, 201, 277, 281, 283, 164, 172, 126, 313, 317, 331, 337 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(n) <= prime(n). LINKS Charles R Greathouse IV, Table of n, a(n) for n = 1..10000 EXAMPLE For n=5, prime(5)+1 = 12; sigma(x) = 12 for x=6 and x=11, so a(5) = 6. MAPLE N:= 100: # to get a(1)..a(N) for i from 1 to N do T(ithprime(i)):= i od: count:= 0: for n from 1 while count < N do v:= numtheory:-sigma(n); if T(v)::posint then   A[T(v)]:= n;   T(v):= 0;     count:= count+1;   fi od: seq(A[i], i=1..N); PROG (PARI) first(n) = my(res = vector(n), p = 2); for(k=1, n, for(x=2, p, if(sigma(x) == p+1, res[k] = x; break())); p = nextprime(p+1)); res \\ Iain Fox, Dec 28 2017 (PARI) first(n)=my(v=vector(n), P=primes(n), left=n, t); forfactored(x=2, P[n], t=setsearch(P, sigma(x)-1); if(t && v[t]==0, v[t]=x[1]; if(left--==0, return(v)))) \\ Charles R Greathouse IV, Dec 28 2017 CROSSREFS Cf. A066077. Sequence in context: A076229 A160102 A318954 * A306923 A137750 A196365 Adjacent sequences:  A296372 A296373 A296374 * A296376 A296377 A296378 KEYWORD nonn AUTHOR Robert Israel, Dec 27 2017 STATUS approved

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

Last modified October 23 23:51 EDT 2019. Contains 328379 sequences. (Running on oeis4.)