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.

A099550 Odd part of n modulo 9.

Original entry on oeis.org

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

Views

Author

Ralf Stephan, Oct 23 2004

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := Mod[n / 2^IntegerExponent[n, 2], 9]; Array[a, 100] (* Amiram Eldar, Aug 29 2024 *)
  • PARI
    a(n) = (n>>valuation(n, 2))%9 \\Charles R Greathouse IV, May 14 2014

Formula

a(n) = A010878(A000265(n)).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = 4. - Amiram Eldar, Aug 29 2024