[go: up one dir, main page]

login
Revision History for A084755 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
Let the sequence s_n be defined by s_n(1) = n+1 and for k > 1, s_n(k) = k*s_n(k-1)+1. Then a(n) is the first prime in the sequence s_n.
(history; published version)
#8 by Charles R Greathouse IV at Mon Apr 25 12:05:00 EDT 2016
PROG

(MatlabMATLAB) s = n + 1; k = 2; while (~isprime(s)) s = k*s + 1; k = k + 1; end a = s

Discussion
Mon Apr 25
12:05
OEIS Server: https://oeis.org/edit/global/2509
#7 by R. J. Mathar at Sat Aug 23 14:24:58 EDT 2014
STATUS

editing

approved

#6 by R. J. Mathar at Sat Aug 23 14:24:54 EDT 2014
AUTHOR

Amarnath Murthy and Meenakshi Srikanth (amarnath_murthymenakan_s(AT)yahoo.com), Jun 16 2003

STATUS

approved

editing

#5 by N. J. A. Sloane at Thu Dec 05 20:08:03 EST 2013
AUTHOR

_Amarnath Murthy _ and Meenakshi Srikanth (amarnath_murthy(AT)yahoo.com), Jun 16 2003

Discussion
Thu Dec 05
20:08
OEIS Server: https://oeis.org/edit/global/2078
#4 by Russ Cox at Sat Mar 31 13:20:48 EDT 2012
EXTENSIONS

Edited and extended by _David Wasserman (wasserma(AT)spawar.navy.mil), _, Sep 09 2003

One more term from _David Wasserman (wasserma(AT)spawar.navy.mil), _, Jan 05 2005

Discussion
Sat Mar 31
13:20
OEIS Server: https://oeis.org/edit/global/880
#3 by N. J. A. Sloane at Fri Feb 27 03:00:00 EST 2009
NAME

Let the sequence s_n be defined by s_n(1) = n+1, and for k > 1, s_n(k) = k*s_n(k-1)+1. Then a(n) is the first prime in the sequence s_n.

KEYWORD

nonn,hard,new

#2 by N. J. A. Sloane at Sun Feb 20 03:00:00 EST 2005
DATA

2, 3, 113, 5, 13, 7, 17, 19, 257, 11, 9157, 13, 29, 31, 401, 17, 37, 19, 41, 43, 82440101, 23, 593, 617, 53, 1117601, 71222359652296203545715260298095475932840563720928496792310817334884559392569395657640073370291521

KEYWORD

nonn,hard,new

EXTENSIONS

Next One more term, if it exists, is greater than 10^97 from David Wasserman (wasserma(AT)spawar.navy.mil), Jan 05 2005

#1 by N. J. A. Sloane at Sat Sep 13 03:00:00 EDT 2003
NAME

Let the sequence s_n be defined by s_n(1) = n+1, and for k > 1, s_n(k) = k*s_n(k-1)+1. Then a(n) is the first prime in the sequence s_n.

DATA

2, 3, 113, 5, 13, 7, 17, 19, 257, 11, 9157, 13, 29, 31, 401, 17, 37, 19, 41, 43, 82440101, 23, 593, 617, 53, 1117601

OFFSET

1,1

COMMENTS

For n = 10r+1, a(n) >= s_n(6).

EXAMPLE

a(3) = 113: 3+1 = 4 is composite, 2*4+1 = 9 is composite, 3*9+1 = 28 is composite, 4*28+1 = 113 is prime.

PROG

(Matlab) s = n + 1; k = 2; while (~isprime(s)) s = k*s + 1; k = k + 1; end a = s

KEYWORD

nonn,hard,new

AUTHOR

Amarnath Murthy and Meenakshi Srikanth (amarnath_murthy(AT)yahoo.com), Jun 16 2003

EXTENSIONS

Edited and extended by David Wasserman (wasserma(AT)spawar.navy.mil), Sep 09 2003

Next term, if it exists, is greater than 10^97.

STATUS

approved