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!)
A089196 Floor(n / (smallest prime factor of n+1)). 1

%I

%S 0,0,1,0,2,0,3,2,4,0,5,0,6,4,7,0,8,0,9,6,10,0,11,4,12,8,13,0,14,0,15,

%T 10,16,6,17,0,18,12,19,0,20,0,21,14,22,0,23,6,24,16,25,0,26,10,27,18,

%U 28,0,29,0,30,20,31,12,32,0,33,22,34,0,35,0,36,24,37,10,38,0,39,26,40

%N Floor(n / (smallest prime factor of n+1)).

%H Vincenzo Librandi, <a href="/A089196/b089196.txt">Table of n, a(n) for n = 1..1000</a>

%F a(n) = A032742(n+1)-1.

%F a(n) = n - A032742(n+1) iff n is odd.

%F a(n) = 0 iff n+1 is prime.

%t Table[Floor[n/FactorInteger[n+1][[1,1]]],{n,100}] (* _Harvey P. Dale_, Aug 05 2014 *)

%Y Cf. A020639.

%K nonn

%O 1,5

%A _Reinhard Zumkeller_, Dec 08 2003

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 June 12 20:20 EDT 2021. Contains 344964 sequences. (Running on oeis4.)