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

%I

%S 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,

%T 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,

%U 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

%N a(n>1) = n - greatest prime divisor of n.

%C a(n)=0 for prime n.

%F a(n) = n - A006530(n). - _Michel Marcus_, Jan 16 2015

%t Table[n-Last@(First/@FactorInteger[n]),{n,2,200}] (* _Vladimir Joseph Stephan Orlovsky_, Apr 08 2011 *)

%Y Cf. A006530, A070229.

%K easy,nonn

%O 2,3

%A _Zak Seidov_, Oct 19 2002

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 January 26 08:18 EST 2020. Contains 331278 sequences. (Running on oeis4.)