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!)
A353187 Lexicographically earliest strictly increasing sequence of positive integers in which every triple of consecutive terms contains only one pair that is not coprime. 4

%I #36 Feb 22 2023 14:59:03

%S 1,2,4,5,6,8,11,12,14,17,18,20,23,24,26,29,30,32,37,38,40,41,42,44,47,

%T 48,50,53,54,56,59,60,62,67,68,70,71,72,74,77,78,80,83,84,86,89,90,92,

%U 97,98,100,101,102,104,107,108,110,113,114,116,119,120,122,127,128,130,131

%N Lexicographically earliest strictly increasing sequence of positive integers in which every triple of consecutive terms contains only one pair that is not coprime.

%C Based on testing the first 1000 primes of the form 3n-1, it seems that A003627 is a subsequence.

%H Ivan N. Ianakiev, <a href="/A353187/b353187.txt">Table of n, a(n) for n = 1..10000</a>

%t next[n_,m_]:=Piecewise[{

%t {(k=m+1; While[!CoprimeQ[k,n]||!CoprimeQ[k,m],k++]; k),AllTrue[{n,m},EvenQ]},

%t {m+2,OddQ[n]&&EvenQ[m]},{m+1,EvenQ[n]&&OddQ[m]}}];

%t a[1]=1;a[2]=2;a[n_]:=a[n]=next[a[n-2],a[n-1]];a/@Range[100]

%o (PARI) { for (v=1, 122, if (v<=2 || ((gcd(pp,p)==1) + (gcd(p,v)==1) + (gcd(v, pp)==1))==2, print1 (v", "); [pp,p]=[p,v])) } \\ _Rémy Sigrist_, May 01 2022

%Y Cf. A047255.

%K nonn

%O 1,2

%A _Ivan N. Ianakiev_, Apr 29 2022

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