|
%I #9 Jul 30 2017 23:04:43
%S 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 92,112,113,114,135,150,158,193,199,200,228,263,264,273,329,350,351,
%U 387,457,464,474,558,614,615,616,661,787,815,826,946,1072,1073,1081,1136
%N 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 Reinhard Zumkeller, <a href="/A061985/b061985.txt">Table of n, a(n) for n = 0..100</a>
%F a(n) = a(n-1) + C(A022328(n) + A022329(n), A022328(n)). - _David Wasserman_, Nov 17 2005
%o (Haskell)
%o a061985 n = a061985_list !! n
%o a061985_list = f (-1) a061984_list where
%o f u (v:vs) = if v == u then f u vs else v : f v vs
%o -- _Reinhard Zumkeller_, Jan 11 2014
%Y Cf. A061984, A061986, A061987.
%K nonn
%O 0,3
%A _Henry Bottomley_, May 24 2001
|
