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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A074240 Numbers n such that n-th prime = sigma(sigma(n)) + 1. 0
1, 110, 798, 8904 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
There are no other numbers < 3400000. - Stefan Steinerberger, Nov 20 2005
LINKS
EXAMPLE
sigma(sigma(110)) + 1 = sigma(216) + 1 = 601 = prime(110).
MATHEMATICA
Select[Range[10^6], Prime[ # ] == DivisorSigma[1, DivisorSigma[1, # ]] + 1 &]
PROG
(MuPAD): ind := 1; nu := 2; repeat w := numlib::sigma(numlib::sigma(ind))+1; if w = nu then print(ind); end_if; ind := ind+1; nu := nextprime(nu+1); until ind>3400000 end_repeat; (Steinerberger)
CROSSREFS
Sequence in context: A250529 A251037 A251038 * A283084 A283180 A283284
KEYWORD
nonn
AUTHOR
Joseph L. Pe, Sep 18 2002
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 8 23:09 EST 2023. Contains 367680 sequences. (Running on oeis4.)