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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A153094 Least k(n) such that k(n)*m^n*(m^n-1)+j is prime with j= -1 or 1 or both and 1<m<10 2
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 2, 1, 1, 1, 4, 1, 1, 1, 3, 5, 2, 1, 1, 3, 2, 2, 2, 9, 6, 1, 6, 4, 1, 1, 4, 1, 2, 2, 3, 6, 6, 5, 1, 5, 5, 1, 2, 1, 10, 3, 5, 1, 3, 2, 1, 4, 5, 2, 2, 3, 1, 1, 2, 3, 5, 5, 6, 1, 12, 3, 5, 6, 1, 2, 9, 3, 4, 1, 1, 5, 2, 3, 4, 7, 2, 2, 16, 8, 5, 1, 5, 5, 6, 3, 2, 11, 2, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,11

COMMENTS

when n increases sum k(n) for i=1 to n / sum n for i=1 to n tends to 0.05, 0<k(n)<0.5*n

LINKS

Pierre CAMI, Table of n, a(n) for n = 1..1000

EXAMPLE

1*2^1*(2^1-1)+1=3 prime so k(1)=1

CROSSREFS

A152414, A152090, A152091, A152092, A152093, A152095

Sequence in context: A087565 A079163 A108536 * A144870 A010640 A087230

Adjacent sequences:  A153091 A153092 A153093 * A153095 A153096 A153097

KEYWORD

nonn

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 | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 18 09:19 EDT 2013. Contains 225419 sequences.