|
%I #16 Sep 10 2014 10:44:18
%S 1,3,2,4,3,2,3,3,2,4,3,2,2,3,2,4,3,2,3,3,2,4,3,3,3,2,4,3,2,3,3,2,4,3,
%T 2,2,3,2,4,3,2,3,3,2,4,3,2,3,2,4,3,2,3,3,2,4,3,2,2,3,2,4,3,2,3,3,2,4,
%U 3,3,3,2,4,3,2,3,3,2,4,3,2,2,3,2,4,3,2,3,3,2,4,4,3,2,4,3,2,3,3
%N Number of times that n occurs in A101402.
%C First differences of A246439; see A246431 for smallest m such that a(m)=n; a(A129117(n)) = 5. - _Reinhard Zumkeller_, Aug 28 2014
%H Reinhard Zumkeller, <a href="/A101403/b101403.txt">Table of n, a(n) for n = 0..10000</a>
%F a(n) > 1 for all n > 0, see comment in A101402. - _Charles R Greathouse IV_, Sep 10 2014
%t A101402[0] = 0; A101402[1] = 1;
%t A101402[n_] := A101402[n] = A101402[2^(Floor[Log[2, n - 1]])] + A101402[n - 1 - 2^(Floor[Log[2, n - 1]])]; TheList = Table[A101402[i], {i, 0, 279}];
%t A101403 = Table[Count[TheList, i], {i, 0, Last[TheList]}]
%t (* Keith Schneider, May 25 2007 *)
%o (Haskell)
%o import Data.List (group)
%o a101403 n = a101403_list !! n
%o a101403_list = map length $ group a101402_list
%o -- _Reinhard Zumkeller_, Aug 27 2014
%Y Cf. A101402, A246431, A246439.
%K easy,nonn
%O 0,2
%A _Odimar Fabeny_, Jan 16 2005
%E More terms from Keith Schneider, May 25 2007
|
