The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A089308 Triangle read by rows, in which n-th row contains n numbers starting with n and in increasing order such that the product of the terms + 1 gives the smallest such prime. 1
 1, 2, 3, 3, 4, 5, 4, 5, 6, 10, 5, 6, 7, 8, 9, 6, 7, 8, 9, 10, 11, 7, 8, 9, 10, 11, 12, 14, 8, 9, 10, 11, 12, 14, 15, 16, 9, 10, 11, 12, 13, 14, 15, 16, 21, 10, 11, 12, 13, 14, 15, 17, 18, 19, 20, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS It is not always the case that the first n-1 terms are n,n+1, n+2, ... 2n-2 etc. and then the last term chosen to yield a prime. The choice of the terms is the one that yields the least prime. LINKS EXAMPLE 1 2 3 3 4 5 4 5 6 10 5 6 7 8 9 ... a(22)..a(28)=7,8,9,10,11,12,14 is the strictly increasing sequence that yields the smallest prime A089307(7)=9313921 of the form 7*n2*n3*..*n7+1, 7

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.

Last modified August 9 22:52 EDT 2020. Contains 336335 sequences. (Running on oeis4.)