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!)
A076361 Numbers k such that d(sigma(k)) = sigma(d(k)). 12
1, 3, 44, 49, 66, 68, 70, 76, 99, 121, 124, 147, 153, 164, 169, 170, 171, 172, 243, 245, 268, 275, 279, 361, 363, 387, 425, 475, 507, 529, 564, 603, 620, 644, 652, 724, 775, 841, 844, 845, 873, 891, 927, 948, 961, 964, 1075, 1083, 1132, 1324, 1348, 1377 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Solutions to A076360(x) = 0.
Assuming Schinzel's hypothesis is true, the sequence is infinite. That conjecture implies that there are infinitely many primes p for which (p^2 + p + 1)/3 is prime. (E.g., p = 7, 13, 19, 31, 43, 73, 97, ...) For such p, we have d(sigma(p^2)) = d(p^2+p+1) = 4 and sigma(d(p^2)) = sigma(3) = 4, so p^2 is in the sequence. - Dean Hickerson, Jan 24 2006
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10029
Eric Weisstein's World of Mathematics, Schinzel's hypothesis.
MATHEMATICA
d0[x_] := DivisorSigma[0, x] d1[x_] := DivisorSigma[1, x] Do[s=d0[d1[n]]-d1[d0[n]]; If[s==0, Print[n]], {n, 1, 10000}]
Select[Range[1380], DivisorSigma[0, DivisorSigma[1, #]] == DivisorSigma[1, DivisorSigma[0, #]] &] (* Jayanta Basu, Mar 26 2013 *)
PROG
(PARI) is(n)=numdiv(sigma(n))==sigma(numdiv(n)) \\ Charles R Greathouse IV, Jun 25 2013
CROSSREFS
Sequence in context: A287959 A346200 A326970 * A130408 A349646 A296279
KEYWORD
easy,nonn
AUTHOR
Labos Elemer, Oct 08 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 April 19 13:40 EDT 2024. Contains 371792 sequences. (Running on oeis4.)