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.

A083569 Smallest m not occurring earlier such that m+n is prime.

Original entry on oeis.org

1, 3, 2, 7, 6, 5, 4, 9, 8, 13, 12, 11, 10, 15, 14, 21, 20, 19, 18, 17, 16, 25, 24, 23, 22, 27, 26, 31, 30, 29, 28, 35, 34, 33, 32, 37, 36, 41, 40, 39, 38, 47, 46, 45, 44, 43, 42, 49, 48, 51, 50, 55, 54, 53, 52, 57, 56, 69, 68, 67, 66, 65, 64, 63, 62, 61, 60, 59, 58, 79, 78, 77
Offset: 1

Views

Author

Amarnath Murthy, Jun 12 2003

Keywords

Comments

a(a(n))=n: a self-inverse permutation with A010051(a(n)+n)=1. - Reinhard Zumkeller, Nov 25 2004

Crossrefs

Cf. A084721.
Cf. A071065.

Programs

  • PARI
    A083569(n)={global(a083569);type(a083569)=="t_VEC"||a083569=vector(n); #a0835691&&u[2]==u[1]+1,u=u[2..-1]));a083569[n]} \\ Returns the n-th term and defines the global array a083569 up to that value at least. For efficiency it is better to (pre)compute a large number of terms at once (via A083569(N_max)) rather than one after the other. - M. F. Hasler, Apr 11 2015

Extensions

More terms from David Wasserman, Nov 19 2004