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!)
A137698 a(1)=2. a(n) = the smallest integer > a(n-1) that is not in sequence A137699. A137699(n) = the smallest integer > A137698(n) and not coprime to A137698(n). (A137699(n) = A137698(n) + smallest prime dividing A137698(n).). 2

%I #10 Apr 09 2014 10:13:04

%S 2,3,5,7,8,9,11,13,15,16,17,19,20,21,23,25,27,28,29,31,32,33,35,37,39,

%T 41,43,44,45,47,49,50,51,53,55,57,59,61,63,64,65,67,68,69,71,73,75,76,

%U 77,79,80,81,83,85,87,88,89,91,92,93,95,97

%N a(1)=2. a(n) = the smallest integer > a(n-1) that is not in sequence A137699. A137699(n) = the smallest integer > A137698(n) and not coprime to A137698(n). (A137699(n) = A137698(n) + smallest prime dividing A137698(n).).

%e Checking for the value of a(17): a(16) = 25. Checking 26, we see that A137699(8) = 26 (because a(8) = 13 and 26 is the smallest integer > 13 that is not coprime to 13). So a(17) does not equal 26. 27, however, does not occur in sequence A137699. So a(17) = 27.

%Y Cf. A137699.

%K easy,nonn

%O 1,1

%A _Leroy Quet_, Feb 06 2008

%E More terms from _Sean A. Irvine_, Feb 12 2012

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 18 06:24 EDT 2024. Contains 371769 sequences. (Running on oeis4.)