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!)
A154689 Numbers n such that sigma_0(n-sigma_0(n))= sigma_0(n). 2
5, 7, 10, 13, 14, 18, 19, 26, 31, 38, 39, 43, 50, 55, 61, 62, 69, 72, 73, 78, 84, 86, 91, 95, 96, 98, 103, 108, 109, 110, 115, 119, 122, 123, 129, 133, 136, 138, 139, 145, 146, 151, 153, 159, 181, 182, 187, 190, 193, 199, 205, 206, 209, 213, 217, 218, 219, 221, 229 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
If n is a term, then n - d(n) is in A175304. Indeed, if N = n - d(n), then d(N) = d(n). Now d(N+d(N)) = d(N+d(n)) = d(n) = d(N). - Vladimir Shevelev, Jul 29 2015
Numbers n such that A000005(n-A000005(n)) = A000005(n). - Typo fixed by Ivan N. Ianakiev, Oct 08 2016
LINKS
J.-M. de Koninck, F. Luca, Positive integers n such that sigma(phi(n))=sigma(n), J. Int. Seq. vol 11 (2008), #08.1.5. [From R. J. Mathar, Jan 15 2009]
MAPLE
A000005 := proc(n) numtheory[tau](n) ; end: for n from 1 to 1000 do a05 := A000005(n) ; if A000005(n-a05) = a05 then printf("%d, ", n) ; fi; od: # R. J. Mathar, Jan 15 2009
MATHEMATICA
snQ[n_]:=Module[{nd=DivisorSigma[0, n]}, DivisorSigma[0, n-nd]==nd]; Select[ Range[300], snQ] (* Harvey P. Dale, Nov 10 2011 *)
PROG
(PARI) is(n)=my(d=numdiv(n)); numdiv(n-d)==d \\ Charles R Greathouse IV, Feb 04 2013
CROSSREFS
Cf. A000005, A006512 (a subsequence).
Sequence in context: A028810 A097700 A172321 * A175766 A243187 A333308
KEYWORD
easy,nonn
AUTHOR
Ctibor O. Zizka, Jan 14 2009
EXTENSIONS
Extended by R. J. Mathar, Jan 15 2009
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 24 14:54 EDT 2024. Contains 371960 sequences. (Running on oeis4.)