This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A327875 Numbers k such that s(k) = s(k+1) where s(k) is the sum of unitary, squarefree divisors of k, including 1 (A092261). 0
 8, 14, 288, 675, 735, 957, 1334, 1634, 2685, 2871, 5750, 8055, 9800, 12104, 12167, 20145, 33998, 42818, 71994, 74918, 79826, 79833, 84134, 111506, 122073, 138237, 144990, 147454, 166934, 201597, 235224, 274533, 289454, 324423, 332928, 347738, 383594, 400315 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS FORMULA 8 is in the sequence since A092261(8) = A092261(9) = 1. MATHEMATICA f[p_, e_] := If[e==1, p+1, 1]; s[n_] := Times @@ f @@@ FactorInteger[n]; s1=0; seq = {}; Do[s2 = s[n]; If[s1 == s2, AppendTo[seq, n-1]]; s1 = s2, {n, 1, 10000}]; seq PROG (PARI) s(n)={sumdiv(n, d, d*issquarefree(d)*(gcd(d, n/d) == 1))} { for(k=1, 10^6, if(s(k)==s(k+1), print1(k, ", "))) } \\ Andrew Howroyd, Sep 28 2019 CROSSREFS Cf. A002961, A064115, A064125, A092261, A164522, A164557, A293183, A306985, A324295, A325175. Sequence in context: A219778 A180756 A279708 * A158967 A253287 A082170 Adjacent sequences:  A327872 A327873 A327874 * A327876 A327877 A327878 KEYWORD nonn AUTHOR Amiram Eldar, Sep 28 2019 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 December 5 22:37 EST 2019. Contains 329782 sequences. (Running on oeis4.)