|
%I #6 Sep 01 2012 13:59:58
%S 1,1,2,1,2,4,3,1,4,3,4,9,4,8,5,1,6,18,10,5,2,13,6,25,19,10,8,41,24,14,
%T 10,1,40,19,8,138,90,55,62,7,17,3,144,63,34,16,16,43,218,148,105,22,7,
%U 39,24,323,371,150,224,54,27,40,30,1,572,444,344,71,32,19,39,1766,52
%N Number of partitions of n into distinct parts occurring in '3x+1'-trajectory starting with n.
%H R. Zumkeller, <a href="/A160001/b160001.txt">Table of n, a(n) for n = 1..100</a>
%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Collatz_conjecture">Collatz conjecture</a>
%H <a href="/index/3#3x1">Index entries for sequences related to 3x+1 (or Collatz) problem</a>
%e 7-22-11-34-17-52-26-13-40-20-10-5-16-8-[4-2-1]*:
%e {1,2,4,5,7} is the set of numbers <= n, occurring in this trajectory, therefore a(7) = #{7, 5+2, 4+2+1} = 3.
%o (Haskell)
%o a160001 n = p (takeWhile (<= n) $ sort $ a070165_row n) n where
%o p _ 0 = 1
%o p [] _ = 0
%o p (k:ks) m = if m < k then 0 else p ks (m - k) + p ks m
%o -- _Reinhard Zumkeller_, Sep 01 2012
%Y Cf. A160000, A000009, A159999, A006370.
%Y Cf. A070165.
%K nonn
%O 1,3
%A _Reinhard Zumkeller_, May 11 2009
|
