Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #6 Jun 07 2018 23:02:45
%S 0,2,10,44,84,122,184,1590,26508,119304,428568,7911144,8275066,
%T 510582192,2122131332,34308911168,543326090824,140627994008752,
%U 140730946295934,576036971191781024,9222527848311467840,9222949803150423996,2359453722081533041216,2361155375874259181576,2361182396716073890056,604433511573276736205056,604435239966141944446584,9664324052998090353961088,618962932654137056803769392,39614074145912329143754325568,633821673403520815917635373056,162257419909717745759000144646368,664613879048405558070320228193928512,170141183222784760671064904320665465984,11150370605423278283522757581632660569339264
%N Record values of A305566.
%C Numbers k such that for some j, k = A305566(j) and k > A305566(i) for i < j.
%C The corresponding record locations appear to be the members of A097212 except 2 and 4.
%p # with f as in A305566
%p recs:= 0: count:= 0: m:= 0:
%p Agenda:= heap[new]((s,t) -> s[2]>t[2], [[1],2]);
%p while count < 34 do
%p T:= heap[extract](Agenda);
%p v:= f(T[2]);
%p if v > m then
%p count:= count+1;
%p recs:= recs, v;
%p m:= v;
%p fi;
%p L:= T[1];
%p heap[insert]([[op(L),1],T[2]*ithprime(nops(L)+1)],Agenda);
%p heap[insert]([L+[1,0$(nops(L)-1)], 2*T[2]],Agenda);
%p for j in select(i -> L[i]<L[i-1],[$2..nops(L)]) do heap[insert]([L + [0$(j-1),1,0$(nops(L)-j)],T[2]*ithprime(j)],Agenda) od;
%p od:
%p recs;
%Y Cf. A097212, A305566.
%K nonn
%O 1,2
%A _Robert Israel_, Jun 07 2018