cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A077316 Triangle read by rows: T(n,k) is the k-th prime = 1 (mod n).

Original entry on oeis.org

2, 3, 5, 7, 13, 19, 5, 13, 17, 29, 11, 31, 41, 61, 71, 7, 13, 19, 31, 37, 43, 29, 43, 71, 113, 127, 197, 211, 17, 41, 73, 89, 97, 113, 137, 193, 19, 37, 73, 109, 127, 163, 181, 199, 271, 11, 31, 41, 61, 71, 101, 131, 151, 181, 191, 23, 67, 89, 199, 331, 353
Offset: 1

Views

Author

Amarnath Murthy, Nov 04 2002

Keywords

Examples

			Triangle begins:
   2;
   3,  5;
   7, 13, 19;
   5, 13, 17, 29;
  11, 31, 41, 61, 71;
  ...

Links

Crossrefs

Cf. A034694 (first column), A077317 (main diagonal), A077318 (row sums), A077319, A093870, A193869 (row products).

Programs

  • Maple
    Tj := proc(n,k) option remember: local j,p: if(k=0)then return 0:fi: for j from procname(n,k-1)+1 do if(isprime(n*j+1))then return j: fi: od: end: A077316 := proc(n,k) return n*Tj(n,k)+1: end: seq(seq(A077316(n,k),k=1..n),n=1..15); # Nathaniel Johnston, Sep 02 2011
  • Mathematica
    Tj[n_, k_] := Tj[n, k] = Module[{j}, If[k == 0, Return[0]];
   For[j = Tj[n, k-1]+1, True, j++, If[PrimeQ[n*j+1], Return[j]]]];
T[n_, k_] := n*Tj[n, k]+1;
Table[Table[T[n, k], {k, 1, n}], {n, 1, 15}] // Flatten (* Jean-François Alcover, Aug 02 2022, after Nathaniel Johnston *)

Extensions

Edited and extended by Franklin T. Adams-Watters, Aug 29 2006

A077317 a(n) is the n-th prime == 1 (mod n).

Original entry on oeis.org

2, 5, 19, 29, 71, 43, 211, 193, 271, 191, 661, 277, 937, 463, 691, 769, 1531, 613, 2357, 1021, 1723, 1409, 3313, 1609, 3701, 2029, 3187, 2437, 6961, 1741, 7193, 3617, 4951, 3877, 7001, 3169, 10657, 6271, 7879, 5521, 13613, 3823, 15137, 7349, 9091, 7499
Offset: 1

Views

Author

Amarnath Murthy, Nov 04 2002, Jul 23 2005 (submitted incorrectly on two separate occasions; each time it has had to be corrected)

Keywords

Comments

a(n) is the n-th prime in the arithmetic progression with first term 1 and common difference n.
Main diagonal of A077316.

Examples

			a(5) = 71, the fifth prime in the sequence 1, 6, 11, 16, 21, 26, 31, 36, 41, 46, 51, 56, 61, 66, 71, ...

Links

Crossrefs

Cf. A034694, A077316, A077318, A077319, A093871.

Programs

  • Maple
    a:=proc(n) local N, B, j: N:=[seq(n*x+1,x=0..500)]: B:={}: for j from 1 to nops(N) do if isprime(N[j])=true then B:=B union {N[j]} else fi od: B[n]: end: seq(a(n),n=1..55); # Emeric Deutsch, Sep 03 2005
  • Mathematica
    Module[{nn=50,prs=Prime[Range[3000]]},Join[{2},Table[Select[prs,Mod[#,n] == 1&][[n]],{n,2,nn}]]] (* Harvey P. Dale, Nov 13 2020 *)

Extensions

Edited, corrected and extended by Emeric Deutsch, Sep 03 2005 and by Franklin T. Adams-Watters, Aug 29 2006
Edited by N. J. A. Sloane, Aug 23 2008 at the suggestion of R. J. Mathar

A077318 Sum of terms in n-th row of A077316.

Original entry on oeis.org

2, 8, 39, 64, 215, 150, 791, 760, 1179, 970, 3619, 1668, 6227, 3360, 5595, 6144, 13821, 5436, 24985, 10280, 17115, 14850, 35765, 18600, 42425, 26390, 43389, 34580, 92481, 24180, 115909, 57440, 79431, 61200, 115605, 55332, 197913, 106020
Offset: 1

Views

Author

Amarnath Murthy, Nov 04 2002

Keywords

Comments

By definition a(n) == 0 (mod n).
It appears that a(n) is also the smallest sum of n distinct primes of the form n*k+1. - Omar E. Pol, Sep 03 2011

Crossrefs

Cf. A034694, A077316, A077317, A077319.

Extensions

Edited, corrected and extended by Franklin T. Adams-Watters, Aug 29 2006
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

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