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!)
A139713 a(0)=1. For n >=1, a(n) = largest positive integer < a(n-1) that is not coprime to the n-th composite, if such an integer exists. Otherwise, a(n) = smallest integer > a(n-1) that is not coprime to the n-th composite. 2

%I #9 Apr 09 2014 10:14:08

%S 1,2,3,2,3,2,3,2,3,2,3,2,3,2,3,5,4,3,2,3,2,3,2,5,4,2,3,2,3,2,3,2,3,7,

%T 6,3,2,3,5,4,3,2,3,2,3,2,5,4,2,3,2,3,2,3,2,7,6,5,3,2,3,5,4,3,2,3,7,6,

%U 3,2,5,4,2,3,2,3,2,3,2,3,2,3,2,3,5,4,3,2,7,6,11,10,9,8,5,4,2,3,2,3,7,6,5,4

%N a(0)=1. For n >=1, a(n) = largest positive integer < a(n-1) that is not coprime to the n-th composite, if such an integer exists. Otherwise, a(n) = smallest integer > a(n-1) that is not coprime to the n-th composite.

%H Diana Mecum, <a href="/A139713/b139713.txt">Table of n, a(n) for n = 0..1199</a>

%Y Cf. A139712, A002808.

%K nonn

%O 0,2

%A _Leroy Quet_, Apr 30 2008

%E More terms from _Diana L. Mecum_, Jul 24 2008

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 25 05:18 EDT 2024. Contains 371964 sequences. (Running on oeis4.)