The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A333301 a(1) = 1, a(2) = 2. For n>2, if a(n-1) is odd, a(n) = a(n-1) + a(n-2), and otherwise a(n) is the smallest missing number. 0

%I #23 Jun 11 2020 03:22:41

%S 1,2,3,5,8,4,6,7,13,20,9,29,38,10,11,21,32,12,14,15,29,44,16,17,33,50,

%T 18,19,37,56,22,23,45,68,24,25,49,74,26,27,53,80,28,30,31,61,92,34,35,

%U 69,104,36,39,75,114,40,41,81,122,42,43,85,128,46,47,93,140,48,51,99,150,52,54,55,109,164

%N a(1) = 1, a(2) = 2. For n>2, if a(n-1) is odd, a(n) = a(n-1) + a(n-2), and otherwise a(n) is the smallest missing number.

%C How many times does each number appear?

%e a(10) is even, so a(11) is the least number yet to appear, which is 9.

%Y Cf. A069202, A307023.

%K nonn,easy

%O 1,2

%A _Andrew Slattery_, Jun 08 2020

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 26 15:24 EDT 2024. Contains 372826 sequences. (Running on oeis4.)