(Translated by https://www.hiragana.jp/)
# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a227836 Showing 1-1 of 1 %I A227836 #17 Sep 08 2022 08:46:05 %S A227836 0,0,0,1,0,2,0,1,0,1,1,0,0,0,1,0,2,0,2,1,0,0,0,2,0,2,1,0,0,0,4,0,3,0, %T A227836 1,0,3,0,2,0,2,1,0,0,0,2,0,2,1,0,0,0,4,0,3,0,2,0,1,0,1,1,0,0,0,1,0,1, %U A227836 1,0,0,0,1,0,1,3,0,0,0,6,0,1,0,1,3,0,0,0,3,0,1,0,1,5,0,0,0,3,0,2,0 %N A227836 2^a(n) is the highest power of 2 dividing A214551(n). %C A227836 This is the 2-adic valuation of A214551. %H A227836 Reinhard Zumkeller, Table of n, a(n) for n = 0..10000 %t A227836 f[l_List] := Append[l, (l[[-1]] + l[[-3]])/GCD[l[[-1]], l[[-3]]]]; %t A227836 A214551[m_] := Nest[f, {1, 1, 1}, m]; IntegerExponent[A214551[200], 2] (* _G. C. Greubel_, Apr 28 2017 *) %o A227836 (Haskell) %o A227836 a227836 = a007814 . a214551 -- _Reinhard Zumkeller_, Aug 05 2013 %o A227836 (Magma) m:=100; A214551:=[i le 2 select 1 else (Self(i)+Self(i-2)) div Gcd(Self(i),Self(i-2)): i in [0..m]]; [Valuation(A214551[n],2): n in [1..m+1]]; // _Bruno Berselli_, Aug 05 2013 %Y A227836 Cf. A000930, A007814, A214551, A227835, A227837. %K A227836 nonn %O A227836 0,6 %A A227836 _N. J. A. Sloane_, Aug 04 2013 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE