login
a(n) = prime(n) + 2*prime(n+1).
2

%I #22 Nov 02 2023 12:33:39

%S 8,13,19,29,37,47,55,65,81,91,105,119,127,137,153,171,181,195,209,217,

%T 231,245,261,283,299,307,317,325,335,367,389,405,415,437,451,465,483,

%U 497,513,531,541,563,577,587,595,621,657,677,685,695,711,721,743,765,783

%N a(n) = prime(n) + 2*prime(n+1).

%C All terms > 8 are odd.

%H Paolo Xausa, <a href="/A364411/b364411.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = a(n-1) + A191472(n-1).

%F a(n) = A000040(n) + A100484(n+1).

%F a(n) = A000040(n+1) + A001043(n).

%t ListConvolve[{2,1},Prime[Range[100]]] (* _Paolo Xausa_, Nov 02 2023 *)

%Y Cf. A000040, A001043, A062234, A100484, A191472 (first differences), A210497.

%K nonn,easy

%O 1,1

%A _Paul Curtz_, Jul 23 2023