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.

A335773 Numbers k such that A334943(k) = 1.

This page as a plain text file.
%I A335773 #17 Jun 26 2021 15:34:27
%S A335773 1,4,37,196,1315,1941,2428,2451,3223,5613,5681,6758,9141,12768,15507,
%T A335773 16206,20076,21373,28827,30252,33442,37466,40332,47532,59355,81769,
%U A335773 92446,94669,99424,109089,114423,123253,129186,149073,191288,200654,202489,212787,229372,234825,237832,284586,300355
%N A335773 Numbers k such that A334943(k) = 1.
%C A335773 Sequence consists of 1 and numbers k such that A334943(k-1) | k.
%H A335773 Robert Israel, <a href="/A335773/b335773.txt">Table of n, a(n) for n = 1..1000</a>
%p A335773 count:= 1: v:= 1: R:= 1:
%p A335773 for n from 2 while count < 100 do
%p A335773    g:= igcd(v,n);
%p A335773    if g > 1 then v:= v/g else v:= 3*v+n+1 fi;
%p A335773    if v = 1 then count:= count+1; R:= R, n; fi
%p A335773 od:
%p A335773 R;
%t A335773 Position[Nest[Append[#1, If[#3 > 1, #1[[-1]]/#3, 3 #1[[-1]] + #2 + 1]] & @@ {#1, #2, GCD[#1[[-1]], #2]} & @@ {#, Length@ # + 1} &, {1}, 10^5], 1][[All, 1]] (* _Michael De Vlieger_, Jun 22 2020 *)
%Y A335773 Cf. A334943.
%K A335773 nonn
%O A335773 1,2
%A A335773 _Robert Israel_, Jun 22 2020