login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

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
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, 37, 39, 40, 42, 43, 45, 46, 48, 50, 51, 53, 54, 56, 57, 59, 60, 62, 63, 65, 66, 68, 69, 71, 72, 74, 75, 77, 78, 80, 81, 83, 84, 86, 87, 89, 90, 92, 93, 95, 96, 97 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Robert Israel, Table of n, a(n) for n = 1..10000

MAPLE

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

for n from 3 to 100 do

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

  A[n]:= k;

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

od:

seq(A[i], i=1..100); # Robert Israel, Nov 29 2017

CROSSREFS

cf. A022442.

Sequence in context: A125236 A137624 A238246 * A054353 A284555 A031948

Adjacent sequences:  A099464 A099465 A099466 * A099468 A099469 A099470

KEYWORD

easy,nonn

AUTHOR

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

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 7 05:14 EST 2019. Contains 329839 sequences. (Running on oeis4.)