A083810 -id:A083810 - cp's OEIS frontend

A083809 Let f(n) be the smallest prime == 1 mod n (cf. A034694). Sequence gives triangle T(j,k) = f^k(j) for 1 <= k <= j, read by rows.

2, 3, 7, 7, 29, 59, 5, 11, 23, 47, 11, 23, 47, 283, 1699, 7, 29, 59, 709, 2837, 22697, 29, 59, 709, 2837, 22697, 590123, 1180247, 17, 103, 619, 2477, 34679, 416149, 7490683, 29962733, 19, 191, 383, 4597, 27583, 330997, 9267917, 74143337, 1038006719

Offset: 1

Amarnath Murthy, May 08 2003

It has been proved in the reference that for every prime p there exists a prime of the form k*p+1. Conjecture: sequence is infinite, i.e., for every n there exists a prime of the form n*k+1 (cf. A034693).

Both follow directly from Dirichlet's theorem. [Charles R Greathouse IV, Feb 28 2012]

			The first few rows of the triangle are
2
3 7
7 29 59
5 11 23 47
11 23 47 283 1699
7 29 59 709 2837 22697

Amarnath Murthy, On the divisors of Smarandache Unary Sequence. Smarandache Notions Journal, Vol. 11, 2000.

Vincenzo Librandi, Table of n, a(n) for n = 1..591

The first column is given by A034694; the sequence of the last terms in the rows (main diagonal) is A083810. Row sums are in A160940.

Cf. A034693.

f:=function(n) m:=1; while not IsPrime(m*n+1) do m+:=1; end while; return m*n+1; end function; &cat[ [ k eq 1 select f(j) else f(Self(k-1)): k in [1..j] ]: j in [1..9] ]; // Klaus Brockhaus, May 30 2009

f[1]=2; f[n_] := f[n] = Block[{p=2}, While[Mod[p, n] != 1, p = NextPrime[p]]; p];
Flatten[Table[Rest @ NestList[f, j, j], {j, 9}]]
(* Jean-François Alcover, May 31 2011, improved by Robert G. Wilson v *)

f(n)=my(k=n+1);while(!isprime(k),k+=n);k
T(j,k)=for(i=1,k,j=f(j));j \\ Charles R Greathouse IV, Feb 28 2012

Edited, corrected and extended by Klaus Brockhaus, May 13 2003

A160940 Row sums of triangle defined in A083809.

Original entry on oeis.org

2, 10, 95, 86, 2063, 26338, 1796701, 37907460, 1121781743, 624173160, 301508365839, 448445587666, 90026771795043, 1998858898554, 406702125332939256247, 78594656763841284, 186966120412500951787

Offset: 1

Klaus Brockhaus, May 30 2009

nonn

			Fourth row is 5, 11, 23, 47, so a(4) = 86.

Cf. A083809, A083810.

f:=function(n) m:=1; while not IsPrime(m*n+1) do m+:=1; end while; return m*n+1; end function; [ &+[ k eq 1 select f(j) else f(Self(k-1)): k in [1..j] ]: j in [1..17] ];

cp's OEIS Frontend

A083809 Let f(n) be the smallest prime == 1 mod n (cf. A034694). Sequence gives triangle T(j,k) = f^k(j) for 1 <= k <= j, read by rows.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Extensions