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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A118065 a(1) = a(2) = 1, a(n) = smallest number greater than a(n-1) that can be written as sum of consecutive earlier terms. 3

%I

%S 1,1,2,3,4,5,6,7,9,10,11,12,13,14,15,16,18,19,20,21,22,23,25,26,27,28,

%T 29,30,31,32,33,34,36,37,38,39,41,42,43,44,45,46,47,48,49,50,51,52,53,

%U 54,55,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,73,74,75,76,77,78

%N a(1) = a(2) = 1, a(n) = smallest number greater than a(n-1) that can be written as sum of consecutive earlier terms.

%C Complement of A118066.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/HofstadterSequences.html">Hofstadter Sequences</a>

%e a(20) = a(11) + a(10) = 11 + 10 = 21;

%e a(21) = a(9) + a(8) + a(7) = 9 + 7 + 6 = 22;

%e a(22) = a(12) + a(11) = 12 + 11 = 23;

%e a(23) = a(13) + a(12) = 13 + 12 = 25;

%e a(24) = a(10) + a(9) + a(8) = 10 + 9 + 7 = 26.

%Y Cf. A005243.

%K nonn

%O 1,3

%A _Reinhard Zumkeller_, Apr 11 2006

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.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 13 14:58 EST 2017. Contains 295958 sequences.