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.

A364213 The number of trailing 0's in the canonical representation of n as a sum of distinct Jacobsthal numbers (A280049).

Original entry on oeis.org

0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 4, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 4, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 6, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 4, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 4, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 0, 0
Offset: 1

Views

Author

Amiram Eldar, Jul 14 2023

Keywords

Comments

The even terms of A007583.
This sequence is unbounded. The first position of 2*k is A007583(k) = (2^(2*k+1) + 1)/3.
The asymptotic density of the occurrences of (2*k) in this sequence is 3/4^(k+1).
The asymptotic mean of this sequence is 2/3 and its asymptotic standard deviation is 4/3.

Crossrefs

Programs

  • Mathematica
    Select[IntegerExponent[Range[100], 2], EvenQ]
  • PARI
    select(x->!(x%2), vector(100, i, valuation(i, 2)))

Formula

a(n) = A122840(A280049(n)).
a(n) = A007583(A003159(n)).