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-5 of 5 results.

A363997 Position in A088732 of the n-th prime.

Original entry on oeis.org

1, 2, 3, 4, 6, 7, 9, 5, 10, 8, 12, 15, 16, 19, 14, 21, 11, 22, 24, 18, 27, 20, 30, 31, 17, 34, 36, 37, 40, 28, 42, 45, 49, 51, 13, 26, 52, 54, 55, 38, 57, 32, 64, 33, 44, 66, 23, 46, 69, 35, 70, 25, 50, 75, 76, 79, 41, 82, 56, 84, 29, 58, 87, 60, 90, 91, 48
Offset: 1

Views

Author

Clark Kimberling, Jul 11 2023

Keywords

Comments

Every positive integer occurs exactly once.

Examples

			a(7) = 5 because the 7th prime, 19, is the 5th term in A088732.
		

Crossrefs

Programs

  • Mathematica
    z= 200; t = Table[k = 1; While[p = n + k*(n + 1); ! PrimeQ[p], k++];
      p, {n, 0, z}];   (* A088732, after Frank M Jackson *)
    Flatten[Table[Position[t, Prime[n]], {n, 1, z}]]  (* this sequence *)

A032448 Smallest prime == -1 modulo prime(n).

Original entry on oeis.org

3, 2, 19, 13, 43, 103, 67, 37, 137, 173, 61, 73, 163, 257, 281, 211, 353, 487, 401, 283, 1021, 157, 331, 1423, 193, 1009, 617, 641, 653, 677, 761, 523, 547, 277, 1489, 1811, 313, 977, 1669, 691, 1789, 1447, 4201, 1543, 787, 397, 421, 1783, 907, 457
Offset: 1

Views

Author

Reinhard Zumkeller, Jun 25 2003

Keywords

Comments

It appears that a(n) <= prime(n)^2-1, where prime(n) = A000040(n) is the n-th prime; see A035095 for a related conjecture. If correct, this implies A006530(a(n)+1)=prime(n), which in turn implies that there are no duplicated values in the sequence.

Crossrefs

Programs

  • Haskell
    a032448 n = head [q | q <- a000040_list, let p = a000040 n,
                          q `mod` p == p - 1]
    -- Reinhard Zumkeller, Aug 08 2013
  • Mathematica
    f[n_] := Block[{p = Prime@ n}, r = p - 1; While[ !PrimeQ@ r, r += p]; r]; Array[f, 50] (* Robert G. Wilson v, Jun 20 2014 *)
  • PARI
    a(n) = {prn = prime(n); p = 2; while(p % prn != prn - 1, p = nextprime(p+1)); p;} \\ Michel Marcus, Aug 04 2013
    

Extensions

Edited by Franklin T. Adams-Watters, Jun 21 2010

A060940 Triangle in which n-th row gives the phi(n) terms appearing as initial primes in arithmetic progressions with difference n, with initial term equal to the smallest positive residue coprimes to n.

Original entry on oeis.org

2, 3, 7, 5, 5, 7, 11, 7, 13, 19, 7, 11, 29, 23, 17, 11, 19, 13, 17, 11, 13, 23, 19, 11, 13, 23, 43, 17, 11, 13, 17, 19, 23, 13, 47, 37, 71, 17, 29, 19, 31, 43, 13, 17, 19, 23, 53, 41, 29, 17, 31, 19, 59, 47, 61, 23, 37, 103, 29, 17, 19, 23, 53, 41, 31, 17, 19, 37, 23, 41, 43, 29
Offset: 1

Views

Author

Labos Elemer, May 07 2001

Keywords

Examples

			For differences 1, 2, 3, 4, 5, 6, 7, .. the initial primes are 2; 3; 7, 5; 5, 7; 11, 7, 13, 19; 7, 11; 29, 23, 17, 11, 19, 13; ... etc. Suitable initial values (coprimes to difference) are in A038566. Position of end(start) of rows is given by values of A002088.
From _Seiichi Manyama_, Apr 02 2018: (Start)
   n | phi(n)|
  ---+-------+------------------------
   1 |   1   |  2;
   2 |   1   |  3;
   3 |   2   |  7,  5;
   4 |   2   |  5,  7;
   5 |   4   | 11,  7, 13, 19;
   6 |   2   |  7, 11;
   7 |   6   | 29, 23, 17, 11, 19, 13;
   8 |   4   | 17, 11, 13, 23;
   9 |   6   | 19, 11, 13, 23, 43, 17;
  10 |   4   | 11, 13, 17, 19;         (End)
		

Crossrefs

A116934 First prime in the arithmetic progression (n+k*p: k>0), where p is the smallest coprime greater than n+1.

Original entry on oeis.org

7, 7, 13, 11, 19, 17, 43, 19, 31, 23, 37, 29, 43, 31, 83, 73, 131, 41, 61, 43, 67, 47, 73, 53, 79, 113, 317, 59, 277, 67, 97, 67, 103, 71, 109, 241, 193, 79, 367, 83, 127, 89, 223, 373, 139, 193, 439, 101, 151, 103, 157, 107, 163, 113, 283, 233, 293, 241, 181, 127, 313
Offset: 1

Views

Author

Reinhard Zumkeller, Feb 27 2006

Keywords

Comments

a(n) = n + A116933(n)*A079578(n).

Crossrefs

Programs

  • Haskell
    a116934 n = head [q | k <- [1..], let q = n + k * a079578 n,
                          a010051' q == 1]
    -- Reinhard Zumkeller, Oct 01 2014

A088733 n-th prime in the arithmetic progression n+k*(n+1) with k>0.

Original entry on oeis.org

3, 11, 19, 79, 41, 167, 127, 233, 179, 461, 227, 883, 433, 569, 719, 1801, 593, 1861, 859, 1553, 1319, 3863, 1103, 3499, 2027, 3671, 2239, 6089, 1499, 6323, 3583, 5147, 3739, 5879, 2843, 11173, 4597, 7253, 4799, 14923, 3779, 14533, 6599, 7919, 7589
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 12 2003

Keywords

Examples

			n=4, the progression starts: 4, 9, 14, 19, 24, 29, 34, 39, 44, 49,
54, 59, 64, 69, 74, 79, 84, 89, etc., with primes 19, 29, 59, 79, 89, etc.,
79 is the fourth prime: a(4)=79.
		

Crossrefs

Cf. A088732.
Cf. A010051.

Programs

  • Haskell
    a088733 n = last $ take n $
                [q | q <- [2 * n + 1, 3 * n + 2 ..], a010051' q == 1]
    -- Reinhard Zumkeller, Oct 01 2014
  • Mathematica
    Table[k = 1; Do[While[p = n + k*(n + 1); ! PrimeQ[p], k++]; k++, {n}]; p, {n, 100}] (* T. D. Noe, Oct 20 2011 *)
Showing 1-5 of 5 results.