|
%I #22 Aug 24 2020 22:27:43
%S 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,
%T 27,28,29,30,32,33,34,35,36,38,39,40,42,44,45,46,48,50,51,52,54,56,57,
%U 58,60,62,63,64,66,68,70,72,74,75,76,78
%N Numbers which can't be represented as a sum of 3 relatively prime positive integers such that each pair of them is not coprime.
%C Complement of A230035.
%C Sequence is finite and contains exactly 156 terms.
%C Generally for every positive integer k there is only a finite quantity of numbers which can't be represented as a sum of k + 1 relatively prime positive integers such that any k of them are not coprime.
%C For instance, for k = 3, 570570 is the largest number which cannot be represented.
%H Vladimir Letsko, <a href="/A230034/b230034.txt">Table of n, a(n) for n = 1..156</a> [uploaded as b-file by _Georg Fischer_, Aug 24 2020]
%H Vladimir Letsko, <a href="http://www-old.fizmat.vspu.ru/doku.php?id=marathon:addition_56">Table of n, a(n) for n=1..156</a> (full sequence, source for b-file)
%e Every positive integer less than 31 is in the sequence because 31 obviously is the least number which can be represented as 2*3 + 2*5 + 3*5, i.e. as a sum of 3 relatively prime positive integers such that every pair of them is not coprime.
%Y Cf. A230035.
%K nonn,fini,full
%O 1,2
%A _Vladimir Letsko_, Dec 20 2013
|
