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.

A158012 A000796(n)*A000796(n+1) mod 9.

Original entry on oeis.org

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

Views

Author

Paul Curtz, Mar 11 2009

Keywords

Comments

The product sequence of adjacent digits of pi is 3,4,4,5,45,18,12,30,15,15,40,72,63,63,27,6,6,24,32...

Programs

  • Mathematica
    Mod[Times@@@Partition[RealDigits[Pi,10,120][[1]],2,1],9] (* Harvey P. Dale, Jun 18 2024 *)

Extensions

Extended by R. J. Mathar, May 21 2009