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 A061985 #9 Jul 30 2017 23:04:43 %S A061985 0,1,2,3,4,6,7,8,11,12,15,19,20,21,27,32,36,37,47,48,54,64,65,80,85, %T A061985 92,112,113,114,135,150,158,193,199,200,228,263,264,273,329,350,351, %U A061985 387,457,464,474,558,614,615,616,661,787,815,826,946,1072,1073,1081,1136 %N A061985 Values which can occur in sequence b(k) = 1 + b(floor(k/2)) + b(floor(k/3)) with b(0) = 0, i.e., in A061984. %H A061985 Reinhard Zumkeller, <a href="/A061985/b061985.txt">Table of n, a(n) for n = 0..100</a> %F A061985 a(n) = a(n-1) + C(A022328(n) + A022329(n), A022328(n)). - _David Wasserman_, Nov 17 2005 %o A061985 (Haskell) %o A061985 a061985 n = a061985_list !! n %o A061985 a061985_list = f (-1) a061984_list where %o A061985 f u (v:vs) = if v == u then f u vs else v : f v vs %o A061985 -- _Reinhard Zumkeller_, Jan 11 2014 %Y A061985 Cf. A061984, A061986, A061987. %K A061985 nonn %O A061985 0,3 %A A061985 _Henry Bottomley_, May 24 2001