[go: up one dir, main page]

login
An Ulam-type sequence: a(n) = n if n<=10; for n>10, a(n) = least number > a(n-1) which is a unique sum of 10 distinct earlier terms.
8

%I #13 May 02 2017 15:30:55

%S 1,2,3,4,5,6,7,8,9,10,55,100,101,102,103,104,105,106,107,108,109,145,

%T 163,190,217,235,271,280,1740,1741,1744,1745,1799,1804,1805,1824,1825,

%U 1831,1859,1869,1913,1914,3554,10521,10522,10526,10527,10537,10563,10564

%N An Ulam-type sequence: a(n) = n if n<=10; for n>10, a(n) = least number > a(n-1) which is a unique sum of 10 distinct earlier terms.

%C An Ulam-type sequence - see A002858 for further information.

%H Alois P. Heinz, <a href="/A183533/b183533.txt">Table of n, a(n) for n = 1..120</a>

%H <a href="/index/U#Ulam_num">Index entries for Ulam numbers</a>

%e a(11) = 55 = 1 + ... + 10 = 10*11/2, because it is the least number >10 with a unique sum of 10 distinct earlier terms.

%e a(12) = 100 = 1 + ... + 9 + 55 = 10^2, because it is the least number >55 with a unique sum of 10 distinct earlier terms.

%p # see A183534 for programs.

%Y Column k=10 of A183534.

%Y Cf. A002858, A007086, A183527-A183532, A135737.

%K nonn

%O 1,2

%A _Jonathan Vos Post_ and _Alois P. Heinz_, Jan 05 2011