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.

A153096 Table T(n,3) read by rows: T(n,1)*T(n,2)^n*(T(n,2)^n-1)+T(n,3) is the smallest possible prime with 1

Original entry on oeis.org

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

Views

Author

Pierre CAMI, Dec 18 2008

Keywords

Examples

			1*2^1*(2^1-1)+1=3 prime so A(n,1)=1,A(n,2)=2,A(n,3)=1
		

Crossrefs

Showing 1-1 of 1 results.