|
%I #12 Apr 10 2014 00:20:45
%S 0,1,1,0,0,0,0,1,1,0,0,0,0,2,1,0,0,0,0,1,2,0,2,1,0,0,0,0,1,2,0,0,0,0,
%T 1,1,0,1,1,0,0,0,0,2,4,0,0,0,0,1,1,0,0,0,0,1,1,0,0,0,0,3,2,0,0,0,0,1,
%U 2,0,0,0,0,2,1,0,1,2,0,0,0,0,2,1,0,0,0,0,1,1,0,0,0,0,1,4,0,0,0,0,0,0,1,0,0,2,0,0,2
%N 3^a(n) is the highest power of 3 dividing A005132(n).
%C The 3-adic valuation of Recamán's sequence A005132.
%H Reinhard Zumkeller, <a href="/A227839/b227839.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/index/Rea#Recaman">Index entries for sequences related to Recamán's sequence</a>
%o (Haskell)
%o a227839 = a007949 . a005132 -- _Reinhard Zumkeller_, Aug 05 2013
%Y Cf. A005132, A227838, A007949.
%K nonn
%O 1,14
%A _N. J. A. Sloane_, Aug 04 2013
|
