cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A213634 n-[n/m], where m is the least nondivisor of n (as in A007978) and [ ] = floor.

This page as a plain text file.
%I A213634 #12 Oct 10 2016 02:44:50
%S A213634 1,2,2,3,3,5,4,6,5,7,6,10,7,10,8,11,9,14,10,14,11,15,12,20,13,18,14,
%T A213634 19,15,23,16,22,17,23,18,29,19,26,20,27,21,32,22,30,23,31,24,39,25,34,
%U A213634 26,35,27,41,28,38,29,39,30,52,31,42,32,43,33,50,34,46,35,47,36
%N A213634 n-[n/m], where m is the least nondivisor of n (as in A007978) and [ ] = floor.
%C A213634 If n is odd, a(n) = (n+1)/2. - _Robert Israel_, Oct 09 2016
%H A213634 Robert Israel, <a href="/A213634/b213634.txt">Table of n, a(n) for n = 1..10000</a>
%e A213634 a(10) = 10 - [10/3] = 7.
%p A213634 f:= proc(n) local m;
%p A213634        for m from 2 do if n mod m <> 0 then return n - iquo(n,m) fi od
%p A213634 end proc:
%p A213634 map(f, [$1..100]); # _Robert Israel_, Oct 09 2016
%t A213634 (See A213633.)
%Y A213634 Cf. A007978, A213633.
%K A213634 nonn,easy
%O A213634 1,2
%A A213634 _Clark Kimberling_, Jun 16 2012