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.

A181670 Triangle read by rows: T(n,k) = 2^(n-1) mod prime(k), 1 <= k <= n.

Original entry on oeis.org

1, 0, 2, 0, 1, 4, 0, 2, 3, 1, 0, 1, 1, 2, 5, 0, 2, 2, 4, 10, 6, 0, 1, 4, 1, 9, 12, 13, 0, 2, 3, 2, 7, 11, 9, 14, 0, 1, 1, 4, 3, 9, 1, 9, 3, 0, 2, 2, 1, 6, 5, 2, 18, 6, 19, 0, 1, 4, 2, 1, 10, 4, 17, 12, 9, 1, 0, 2, 3, 4, 2, 7, 8, 15, 1, 18, 2, 13, 0, 1, 1, 1, 4, 1, 16, 11, 2, 7, 4, 26, 37, 0, 2, 2, 2, 8, 2, 15
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Dec 02 2010

Keywords

Examples

			Triangle begins:
  1;
  0, 2;
  0, 1, 4;
  0, 2, 3, 1;
  0, 1, 1, 2, 5;
  0, 2, 2, 4,10, 6;
  0, 1, 4, 1, 9,12,13;
  0, 2, 3, 2, 7,11, 9,14;
  0, 1, 1, 4, 3, 9, 1, 9, 3;
		

Crossrefs

Cf. A174620.

Programs

  • Mathematica
    Flatten[Table[Mod[2^(n-1),Prime[k]],{n,14},{k,n}]]

Extensions

Corrected by T. D. Noe, Dec 02 2010