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 A350618 #33 Jul 27 2024 23:53:19
%S A350618 3,6,8,8,12,16,18,28,30,44,42,58,70,78,86,96,62,92,90,116,102,130,148,
%T A350618 126,160,106,156,146,182,204,178,220,192,142,220,206,260,228,224,180,
%U A350618 224,188,238,312,236,258,340,308,304,248,264,272,258,380,352,274,406,474,514,538,552,362,488,372,406,520,396,436
%N A350618 Terms in A350877 that immediately follow an odd term.
%C A350618 a(n) = A350617(n) + prime(n). Also a(n) = 2^A350833(n) * A350617(n+1).
%C A350618 This is a compressed version of A350877: when A350877 reaches an even number e, the following steps repeatedly divide e by 2 until an odd number is reached. In the present sequence the results of those divisions are suppressed.
%C A350618 For example, A350877 (n>=2) begins 1, 3, 6, [3,] 8, [4, 2, 1,] 8, [4, 2, 1,] 12, [6, 3,] 16, [8, 4, 2, 1,] 18, ..., where the suppressed terms are enclosed in square brackets.
%C A350618 The scatterplot of the present sequence is the same as the red-colored portion of Sigrist's colored scatterplot in A350877.
%H A350618 N. J. A. Sloane, <a href="/A350618/b350618.txt">Table of n, a(n) for n = 1..20000</a> (first 10000 terms from Michael De Vlieger)
%t A350618 j = 1; q = 2; Reap[Do[If[EvenQ[j], Set[k, j/2], Set[k, j + q]; Set[q, NextPrime[q]]]; If[OddQ[j], Sow[i + 1]]; j = k, {i, 2, 436}]][[-1, -1]] (* _Michael De Vlieger_, Jan 23 2022 *)
%Y A350618 Cf. A350877, A350615, A350616, A350617, A350619, A350620, A350621, A350833.
%K A350618 nonn
%O A350618 1,1
%A A350618 _N. J. A. Sloane_, Jan 23 2022, revised Jan 28 2022