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 A364411 #26 Jan 03 2025 05:43:49
%S A364411 8,13,19,29,37,47,55,65,81,91,105,119,127,137,153,171,181,195,209,217,
%T A364411 231,245,261,283,299,307,317,325,335,367,389,405,415,437,451,465,483,
%U A364411 497,513,531,541,563,577,587,595,621,657,677,685,695,711,721,743,765,783
%N A364411 a(n) = prime(n) + 2*prime(n+1).
%C A364411 All terms > 8 are odd.
%H A364411 Paolo Xausa, <a href="/A364411/b364411.txt">Table of n, a(n) for n = 1..10000</a>
%F A364411 a(n) = a(n-1) + A191472(n-1).
%F A364411 a(n) = A000040(n) + A100484(n+1).
%F A364411 a(n) = A000040(n+1) + A001043(n).
%t A364411 ListConvolve[{2,1},Prime[Range[100]]] (* _Paolo Xausa_, Nov 02 2023 *)
%Y A364411 Cf. A000040, A001043, A062234, A094105, A100484, A191472 (first differences), A210497.
%K A364411 nonn,easy
%O A364411 1,1
%A A364411 _Paul Curtz_, Jul 23 2023