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.

A146082 a(n) = A146081(n) mod 9.

Original entry on oeis.org

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

Views

Author

Paul Curtz, Oct 27 2008

Keywords

Comments

A periodic double sawtooth pattern of positive even and odd numbers.

Programs

  • Magma
    &cat[[2,4,6,8,1,3,5,7,0]^^10]; // Vincenzo Librandi, Jan 30 2016
  • Mathematica
    a := LinearRecurrence[{2, -1}, {110, 184}, 100];
    Mod[a, 9] (* G. C. Greubel, Jan 29 2016 *)
    PadRight[{},120,{2,4,6,8,1,3,5,7,0}] (* Harvey P. Dale, Sep 18 2016 *)

Formula

a(n) = A131669(n+2)-1.
Period 9: a(n+9)=a(n).
a(n) = (74*n + 110) mod 9. - G. C. Greubel, Jan 29 2016

Extensions

Edited by R. J. Mathar, Dec 08 2008
Showing 1-1 of 1 results.