login
This site is supported by donations to The OEIS Foundation.
Logo

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; internal format)
OFFSET

1,1

LINKS

Charles R Greathouse IV, Home Page [Listed in lieu of email address]

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: A068831 A109862 A069804 * A070334 A137700 A195821

Adjacent sequences:  A121973 A121974 A121975 * A121977 A121978 A121979

KEYWORD

nonn

AUTHOR

Charles R. Greathouse IV, Sep 05 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 13 02:33 EST 2012. Contains 205435 sequences.