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.

A134651 Numbers which are the sum of two terms from A001043.

This page as a plain text file.
%I A134651 #12 Jul 17 2025 11:51:05
%S A134651 10,13,16,17,20,23,24,26,29,30,32,35,36,38,41,42,44,47,48,50,54,57,60,
%T A134651 64,65,66,68,70,72,73,76,78,80,82,83,84,86,88,89,90,92,94,95,96,98,
%U A134651 102,104,105,108,110,112,114,117,118,120,124,125,126,128,130,132,133,136,138,140
%N A134651 Numbers which are the sum of two terms from A001043.
%H A134651 B. D. Swan, <a href="/A134651/b134651.txt">Table of n, a(n) for n = 1..60000</a>
%e A134651 Recall that A001043 begins with 5,8,12, ..
%e A134651 So 10 (5+5), 13 (5+8), 16 (8+8), 17 (5+12), 20 (8+12) are in the sequence.
%o A134651 (PARI) issum(i, vss) = {for (j = 1, #vss, if (vss[j] > i, break); for (k = 1, #vss, sv = vss[j] + vss[k]; if (sv == i, return (1)); if (sv > i, break););); return (0);}
%o A134651 lista(nn) = {vec = vector(nn, i, i); vss = select(i->((precprime((i-1)/2) + nextprime(i/2) == i) && (i>2)), vec); for (i = 1, nn, if (issum(i, vss), print1(i, ", ")););} \\ _Michel Marcus_, Oct 14 2013
%Y A134651 Cf. A001043, A134650.
%K A134651 nonn,easy
%O A134651 1,1
%A A134651 _N. J. A. Sloane_, Jan 25 2008