This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A099467 a(1) = a(2) = 1; for n > 2, a(n) is the smallest number > a(n-1) which is not the sum of 2 consecutive elements of the sequence. 2

%I

%S 1,1,3,5,6,7,9,10,12,14,15,17,18,20,21,23,24,25,27,28,30,31,33,34,36,

%T 37,39,40,42,43,45,46,48,50,51,53,54,56,57,59,60,62,63,65,66,68,69,71,

%U 72,74,75,77,78,80,81,83,84,86,87,89,90,92,93,95,96,97

%N a(1) = a(2) = 1; for n > 2, a(n) is the smallest number > a(n-1) which is not the sum of 2 consecutive elements of the sequence.

%H Robert Israel, <a href="/A099467/b099467.txt">Table of n, a(n) for n = 1..10000</a>

%p A[1]:= 1: A[2]:= 1: forbid:= {2}:

%p for n from 3 to 100 do

%p for k from A[n-1]+1 while member(k, forbid) do od:

%p A[n]:= k;

%p forbid:= forbid union {A[n-1]+k};

%p od:

%p seq(A[i],i=1..100); # _Robert Israel_, Nov 29 2017

%Y cf. A022442.

%K easy,nonn

%O 1,3

%A Gaetan Polard (gaetan27(AT)hotmail.com), Nov 18 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 23 16:26 EDT 2018. Contains 304483 sequences. (Running on oeis4.)