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!)
A343402 Numbers k such that A260815(k) > A260815(k-1)+1. 1

%I #11 Apr 14 2021 08:57:07

%S 3,4,23,29,39,1559,1593,2435519,2435534,2485805,2485806,2485810,

%T 2485827,2486989,5936893149287,5936893149290,5936949030071,

%U 5936949030092,5936949030103,5936949030105,5936949030115,5936949030121,35246700334321411113125039,1242329884457453073932774588160466662938743561876559

%N Numbers k such that A260815(k) > A260815(k-1)+1.

%e a(3) = 23 is in the sequence because A260815(23) - A260815(22) = 575 - 46 > 1.

%p G:= proc(nv)

%p local n,v,k,np;

%p n:= nv[1]; v:= nv[2];

%p k:= min(seq((-n-1) mod p, p = numtheory:-factorset(v-n-1)));

%p np:= n+k+1;

%p [np, v+k+igcd(np,v+k)^2]

%p end proc:

%p R:= 3: t:= [3,12]:

%p for i from 2 to 24 do

%p t:= G(t);

%p R:= R, t[1];

%p od:

%p R;

%t 2 + Position[Differences @ Nest[Append[#1, #1[[-1]] + GCD[#2, #1[[-1]]]^2] & @@ {#, Length[#] + 2} &, {3}, 10000], _?(# > 1 &)] // Flatten (* _Amiram Eldar_, Apr 14 2021 after _Michael De Vlieger_ at A260815 *)

%Y Cf. A260815.

%K nonn

%O 1,1

%A _Robert Israel_, Apr 13 2021

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 August 22 00:18 EDT 2024. Contains 375353 sequences. (Running on oeis4.)