cp's OEIS Frontend

A084146 Integers that have exactly one representation as a sum of two or more consecutive primes.

%I A084146 #23 Feb 16 2025 08:32:49
%S A084146 5,8,10,12,15,17,18,23,24,26,28,30,31,39,42,48,49,52,53,56,58,59,67,
%T A084146 68,71,75,77,78,84,88,95,97,98,101,102,109,121,124,127,128,129,131,
%U A084146 132,139,144,150,155,156,158,159,160,161,162,168,169,172,173,181,184,186,192
%N A084146 Integers that have exactly one representation as a sum of two or more consecutive primes.
%C A084146 More fundamental than A050936, which gives integers having 1 *or more* such representations
%H A084146 T. D. Noe, <a href="/A084146/b084146.txt">Table of n, a(n) for n=1..10000</a>
%H A084146 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PrimeSums.html">Prime Sums</a>
%F A084146 A084143(a(n)) = 1. - _Ray Chandler_, Sep 20 2023
%p A084146 # uses code of A084143
%p A084146 isA084146 := proc(n::integer)
%p A084146     if A084143(n) = 1 then
%p A084146         true;
%p A084146     else
%p A084146         false;
%p A084146     end if;
%p A084146 end proc:
%p A084146 for n from 1 to 300 do
%p A084146     if isA084146(n) then
%p A084146         printf("%d,",n) ;
%p A084146     end if;
%p A084146 end do: # _R. J. Mathar_, Aug 19 2020
%Y A084146 Cf. A050936, A084143, A337095 (subset of primes).
%K A084146 nonn
%O A084146 1,1
%A A084146 _Eric W. Weisstein_, May 15 2003
%E A084146 More terms from _Matthew Conroy_, May 25 2003