login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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<T(n,2)<10 and T(n,3)=-1 or +1. 1
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..63.

Pierre CAMI, The first 1000 rows of the table

EXAMPLE

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

CROSSREFS

A152414, A153090, A153091, A153092, A153093, A153094, A153095

Sequence in context: A213852 A051064 A280509 * A320010 A210763 A281681

Adjacent sequences:  A153093 A153094 A153095 * A153097 A153098 A153099

KEYWORD

tabf,sign

AUTHOR

Pierre CAMI, Dec 18 2008

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 24 16:39 EDT 2019. Contains 326295 sequences. (Running on oeis4.)