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 A058361 #6 May 07 2022 09:26:52
%S A058361 3,1,4,15,22,121,735,31,46,22143,4468,67,31455,391,2308,447,94,33151,
%T A058361 16383,139,202,7551,5224,787,1595391,3685,580,30591,418,42495,1791,
%U A058361 607,1342,3217407,1095166,283,398847,32767,365311,88575,1174,6925,12304383
%N A058361 a(n) is the least k in A002977 with a gap of n. Also n + a(n) is the least k in A007448 which is repeated n times.
%H A058361 Amiram Eldar, <a href="/A058361/b058361.txt">Table of n, a(n) for n = 1..84</a>
%t A058361 k = {1}; Do[ k = Union[ Join[ k, 2k + 1, 3k + 1 ] ]; l = Length[ k ]; i = 1; While[ i < l && k[ [ i ] ] < 10^9, i++ ]; k = Take[ k, {1, i} ], {n, 1, 30} ]; f[ n_Integer ] := (i = 1; While[ k[ [ i + 1 ] ] - k[ [ i ] ] != n, i++ ]; k[ [ i ] ]); Table[ f[ n ], {n, 1, 84} ]
%Y A058361 Cf. A002977, A007448.
%K A058361 nonn
%O A058361 1,1
%A A058361 _Robert G. Wilson v_, Dec 16 2000