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.
%I A378029 #7 Nov 17 2024 07:30:07 %S A378029 0,2,6,8,10,20,22,42,54,58,110,156,162,166,168,294,342,506,812,930, %T A378029 1210,1332,1458,2028,2162,2756,3422,3660,4422,4970,6162,6498,6806, %U A378029 7832,10100,11342,11638,13310,16002,17030,19182,22052,23548,26406,27722,28830,29756,31862,32580,38612,39402,44310,49506 %N A378029 Record values in A377059. %C A378029 Numbers k such that for some j, A377059(j) = k and A377059(i) < k for all i < j. %F A378029 a(n) = A377059(A378028(n)). %e A378029 a(3) = 6 because A377059(9) = 6 and A377059(k) < 6 for all k < 9. %p A378029 f:= proc(n) local x, r; %p A378029 for x from 2 to n do %p A378029 if igcd(x, n) <> 1 then next fi; %p A378029 r:= numtheory:-order(x, n); %p A378029 if r::even and r < n-1 then return r fi %p A378029 od; %p A378029 0 %p A378029 end proc: %p A378029 R:= 1: m:= 0: count:= 0: %p A378029 for k from 2 while count < 100 do %p A378029 v:= f(k); %p A378029 if v > m then m:= v; R:= R, v; count:= count+1 fi; %p A378029 od: %p A378029 R; %Y A378029 Cf. A377059, A378028. %K A378029 nonn %O A378029 1,2 %A A378029 _Robert Israel_, Nov 14 2024