cp's OEIS Frontend

A136603 Positive numbers having a unique representation by inserting minus and plus-signs in 123456789.

%I A136603 #10 Mar 21 2013 11:02:44
%S A136603 176,191,194,196,209,213,215,217,223,237,253,259,263,272,274,275,289,
%T A136603 290,292,293,295,305,307,308,353,361,367,379,380,381,382,386,392,399,
%U A136603 401,405,415,416,418,419,427,443,461,463,467,475,477,479,481,490,491
%N A136603 Positive numbers having a unique representation by inserting minus and plus-signs in 123456789.
%C A136603 A066957(a(n)) = 1; subsequence of A136601;
%C A136603 the sequence is finite with 869 terms.
%H A136603 R. Zumkeller, <a href="/A136603/b136603.txt">Table of n, a(n) for n = 1..869</a> (full sequence)
%e A136603 a(1) = 176 = 1 - 2 + 34 + 56 + 78 + 9;
%e A136603 a(2) = 191 = 123 + 4 + 56 + 7 - 8 + 9;
%e A136603 a(3) = 194 = 1 - 2 + 34 + 5 + 67 + 89;
%e A136603 a(4) = 196 = -1 + 2 + 34 + 5 + 67 + 89;
%e A136603 a(5) = 209 = 1 + 234 + 56 + 7 - 89;
%e A136603 a(6) = 213 = 123 + 4 + 5 - 6 + 78 + 9;
%e A136603 a(7) = 215 = 123 + 4 - 5 + 6 + 78 + 9;
%e A136603 a(8) = 217 = 123 - 4 + 5 + 6 + 78 + 9;
%e A136603 a(9) = 223 = -1 + 23 + 45 + 67 + 89;
%e A136603 a(10) = 237 = -123 + 456 - 7 - 89;
%e A136603 a(11) = 253 = -1 + 2 + 345 - 6 - 78 - 9;
%e A136603 a(12) = 259 = -1 + 234 - 56 - 7 + 89;
%e A136603 a(869) = 123456789 = A136602(1715).
%K A136603 nonn,fini,full,base
%O A136603 1,1
%A A136603 _Reinhard Zumkeller_, Jan 12 2008