cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A227836 2^a(n) is the highest power of 2 dividing A214551(n).

Original entry on oeis.org

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, 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, 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
Offset: 0

Views

Author

N. J. A. Sloane, Aug 04 2013

Keywords

Comments

This is the 2-adic valuation of A214551.

Crossrefs

Programs

  • Haskell
    a227836 = a007814 . 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],2): n in [1..m+1]]; // Bruno Berselli, Aug 05 2013
  • 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], 2] (* G. C. Greubel, Apr 28 2017 *)

A227837 3^a(n) is the highest power of 3 dividing A214551(n).

Original entry on oeis.org

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
Offset: 0

Views

Author

N. J. A. Sloane, Aug 04 2013

Keywords

Comments

This is the 3-adic valuation of A214551.

Crossrefs

Programs

  • 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
  • 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 *)

A227834 2^a(n) is the highest power of 2 dividing A000930(n).

Original entry on oeis.org

0, 0, 0, 1, 0, 2, 1, 0, 0, 0, 2, 0, 2, 3, 0, 0, 0, 1, 0, 3, 1, 0, 0, 0, 3, 0, 3, 7, 0, 0, 0, 1, 0, 2, 1, 0, 0, 0, 2, 0, 2, 3, 0, 0, 0, 1, 0, 4, 1, 0, 0, 0, 4, 0, 4, 6, 0, 0, 0, 1, 0, 2, 1, 0, 0, 0, 2, 0, 2, 3, 0, 0, 0, 1, 0, 3, 1, 0, 0, 0, 3, 0, 3, 6, 0, 0, 0, 1, 0, 2, 1, 0, 0, 0, 2, 0, 2, 3, 0, 0, 0, 1, 0, 5, 1, 0, 0, 0, 5, 0, 5, 7, 0
Offset: 0

Views

Author

N. J. A. Sloane, Aug 04 2013

Keywords

Comments

This is the 2-adic valuation of A000930.

Crossrefs

Programs

Showing 1-3 of 3 results.