This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A333301 #23 Jun 11 2020 03:22:41 %S A333301 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 A333301 18,19,37,56,22,23,45,68,24,25,49,74,26,27,53,80,28,30,31,61,92,34,35, %U A333301 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 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. %C A333301 How many times does each number appear? %e A333301 a(10) is even, so a(11) is the least number yet to appear, which is 9. %Y A333301 Cf. A069202, A307023. %K A333301 nonn,easy %O A333301 1,2 %A A333301 _Andrew Slattery_, Jun 08 2020