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.

Previous Showing 11-11 of 11 results.

A178948 a(n) = smallest m>=0 such that n*(3^m)-1 is prime, or -1 if no such prime exists.

Original entry on oeis.org

1, 1, 0, 0, -1, 0, -1, 0, -1, 1, -1, 0, -1, 0, -1, 1, -1, 0, -1, 0, -1, 2, -1, 0, -1, 2, -1, 1, -1, 0, -1, 0, -1, 1, -1, 1, -1, 0, -1, 2, -1, 0, -1, 0, -1, 1, -1, 0, -1, 1, -1, 2, -1, 0, -1, 1, -1, 1, -1, 0, -1, 0, -1, 1, -1, 1, -1, 0, -1, 3, -1, 0, -1, 0, -1, 1, -1, 1, -1, 0, -1, 3, -1, 0, -1, 1, -1, 1, -1, 0
Offset: 1

Views

Author

Jonathan Vos Post, Dec 31 2010

Keywords

Comments

For odd n>=5, a(n)=-1 because then n*3^m is odd, therefore n*3^m-1 even and not prime. - R. J. Mathar, Jan 03 2011

Examples

			a(1) = 1 because 1*(3^1) - 1 = 2 is prime.
a(5) = -1 because 5*(3^m) - 1 is even and >=4.
a(22) = 2 because 22*(3^2)-1 = 197 is prime.
		

Crossrefs

Previous Showing 11-11 of 11 results.