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.

A305657 Record values of A305566.

Original entry on oeis.org

0, 2, 10, 44, 84, 122, 184, 1590, 26508, 119304, 428568, 7911144, 8275066, 510582192, 2122131332, 34308911168, 543326090824, 140627994008752, 140730946295934, 576036971191781024, 9222527848311467840, 9222949803150423996, 2359453722081533041216, 2361155375874259181576, 2361182396716073890056, 604433511573276736205056, 604435239966141944446584, 9664324052998090353961088, 618962932654137056803769392, 39614074145912329143754325568, 633821673403520815917635373056, 162257419909717745759000144646368, 664613879048405558070320228193928512, 170141183222784760671064904320665465984, 11150370605423278283522757581632660569339264
Offset: 1

Views

Author

Robert Israel, Jun 07 2018

Keywords

Comments

Numbers k such that for some j, k = A305566(j) and k > A305566(i) for i < j.
The corresponding record locations appear to be the members of A097212 except 2 and 4.

Crossrefs

Programs

  • Maple
    # with f as in A305566
    recs:= 0: count:= 0: m:= 0:
    Agenda:= heap[new]((s,t) -> s[2]>t[2], [[1],2]);
    while count < 34 do
      T:= heap[extract](Agenda);
      v:= f(T[2]);
      if v > m then
        count:= count+1;
        recs:= recs, v;
        m:= v;
      fi;
      L:= T[1];
      heap[insert]([[op(L),1],T[2]*ithprime(nops(L)+1)],Agenda);
      heap[insert]([L+[1,0$(nops(L)-1)], 2*T[2]],Agenda);
      for j in select(i -> L[i]