login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

a(0)=0 and for n>0, a(n) is the smallest positive integer that cannot be derived by the adding or subtracting at most three terms with values in {a(0),...,a(n-1)} allowing repeats.
0

%I #3 Mar 30 2012 17:23:30

%S 0,1,4,10,17,29,52,67,89,132,164,205,259,303,350,405,505,529,588,680,

%T 903,1016,1061,1248,1358,1445,1838,1878,2086,2117,2195,2613,2840,3060,

%U 3314,3422,3816,4097,4247,4565,4705,5326,5511,5777,6104,6247,6796,7073

%N a(0)=0 and for n>0, a(n) is the smallest positive integer that cannot be derived by the adding or subtracting at most three terms with values in {a(0),...,a(n-1)} allowing repeats.

%C Stated in more concrete terms, a(n) is the smallest amount of a transaction that cannot be achieved with the transfer (in either direction) of at most 3 coins with values among the previous terms.

%e a(4)=17 because: 11=10+1, 12=10+1+1, 13=10+4-1, 14=10+4, 15=10+4+1, 16=10+10-4, but there is no way to create 17 using at most three values in {1,4,10}

%K nonn

%O 0,3

%A _Andrew Weimholt_, Jul 22 2004