login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A227837 3^a(n) is the highest power of 3 dividing A214551(n). 3
0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 2, 0, 1, 0, 2, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 3, 0, 0, 0, 2, 0, 0, 0, 0, 2, 0, 2, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 3, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 5, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,14
COMMENTS
This is the 3-adic valuation of A214551.
LINKS
MATHEMATICA
f[l_List] := Append[l, (l[[-1]] + l[[-3]])/GCD[l[[-1]], l[[-3]]]];
A214551[m_] := Nest[f, {1, 1, 1}, m]; IntegerExponent[A214551[200], 3] (* G. C. Greubel, Apr 28 2017 *)
PROG
(Haskell)
a227837 = a007949 . a214551 -- Reinhard Zumkeller, Aug 05 2013
(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], 3): n in [1..m+1]]; // Bruno Berselli, Aug 05 2013
CROSSREFS
Sequence in context: A357883 A091728 A108069 * A263099 A254001 A089734
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Aug 04 2013
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)