login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A076563 a(n>1) = n - greatest prime divisor of n. 1
0, 0, 2, 0, 3, 0, 6, 6, 5, 0, 9, 0, 7, 10, 14, 0, 15, 0, 15, 14, 11, 0, 21, 20, 13, 24, 21, 0, 25, 0, 30, 22, 17, 28, 33, 0, 19, 26, 35, 0, 35, 0, 33, 40, 23, 0, 45, 42, 45, 34, 39, 0, 51, 44, 49, 38, 29, 0, 55, 0, 31, 56, 62, 52, 55, 0, 51, 46, 63, 0, 69, 0, 37, 70, 57, 66, 65, 0, 75 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,3

COMMENTS

a(n)=0 for prime n.

LINKS

Table of n, a(n) for n=2..80.

FORMULA

a(n) = n - A006530(n). - Michel Marcus, Jan 16 2015

MATHEMATICA

Table[n-Last@(First/@FactorInteger[n]), {n, 2, 200}] (* Vladimir Joseph Stephan Orlovsky, Apr 08 2011 *)

CROSSREFS

Cf. A006530, A070229.

Sequence in context: A130628 A249431 A331176 * A163974 A317443 A308218

Adjacent sequences:  A076560 A076561 A076562 * A076564 A076565 A076566

KEYWORD

easy,nonn

AUTHOR

Zak Seidov, Oct 19 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 6 18:32 EDT 2020. Contains 333286 sequences. (Running on oeis4.)