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-1 of 1 results.

A278478 a(n) is the 2-adic valuation of A000041(n).

Original entry on oeis.org

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

Views

Author

Joerg Arndt, Nov 23 2016

Keywords

Comments

Write A000041(n) = 2^k * s where s is odd, then a(n) = k.

Crossrefs

Cf. A052002, A237280, A278779, A278780, A278781, A278782, A278783, A278784 (positions of terms 0, 1, 2, ..., 7 in this sequence).
Cf. also A278241.

Programs

  • Maple
    a:= n-> padic[ordp](combinat[numbpart](n), 2):
    seq(a(n), n=0..120);  # Alois P. Heinz, Nov 23 2016
  • Mathematica
    a[n_] := IntegerExponent[PartitionsP[n], 2]; Array[a, 100, 0] (* Amiram Eldar, May 25 2024 *)
  • PARI
    { my( x='x+O('x^100), v=Vec(1/eta(x)) ); vector(#v,n,valuation(v[n],2)) }

Formula

From Amiram Eldar, May 25 2024: (Start)
a(n) = A007814(A000041(n)).
a(n) = log_2(A069935(n)). (End)
Showing 1-1 of 1 results.