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.

A053844 (Sum of digits of n written in base 9) modulo 9.

Original entry on oeis.org

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

Views

Author

Henry Bottomley, Mar 28 2000

Keywords

Crossrefs

Eighth row of the array in A141803.

Programs

  • Mathematica
    Mod[DigitSum[Range[0, 100], 9], 9] (* Paolo Xausa, Aug 09 2024 *)

Formula

a(n) = A010878(A053830(n)). - Paolo Xausa, Aug 09 2024