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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A121976 Increasing sequence of odd primes such that abundancy(a(1)*...*a(n)) < 2, where abundancy(k) = A000203(k)/k. Generates "near perfect numbers". 0
 3, 5, 7, 11, 389, 29959, 128194589, 566684450325197, 29753376105337343078941364947, 30082232218581187462432471034748868284388270918928732239 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Valeryi Kuryshev, NMBRTHRY Archives, 2006 FORMULA a(n) = nextprime(1 / (2 / abundancy(a(1) * ... * a(n-1)) - 1)) for n >= 4 EXAMPLE a(5)=389 because abundancy(3*5*7*11*383) = 2.000013... > 2 and abundancy(3*5*7*11*389) = 1.999933... < 2. PROG (PARI) print(3); print(5); print(7); n=105; for(i=4, 7, k=nextprime(1 / (2 / abundancy(n) - 1)); print(k); ); CROSSREFS Cf. A000396, A000203. Sequence in context: A245722 A262962 A321367 * A339789 A293598 A243179 Adjacent sequences:  A121973 A121974 A121975 * A121977 A121978 A121979 KEYWORD nonn AUTHOR Charles R Greathouse IV, Sep 05 2006 STATUS approved

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.

Last modified May 27 12:58 EDT 2022. Contains 354097 sequences. (Running on oeis4.)