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

A110409 Number of times repeated reverse concatenation of n followed by n gives a prime, where n == 1,3,7 or 9 (mod 10), or 0 if no such prime exists.

Original entry on oeis.org

1, 0, 0, 0, 0, 10, 3, 7, 0, 3, 0, 10, 3, 0, 22, 0, 51, 7, 9, 10, 0, 412, 0, 16, 18, 0, 3, 0, 3, 3, 0, 9, 0, 3, 0, 3, 4, 0, 3, 0, 0
Offset: 0

Views

Author

Amarnath Murthy, Jul 30 2005

Keywords

Comments

Except for the first term every nonzero term is >1.
The larger numbers are probable primes. - Joshua Zucker, May 10 2006
The sequence probably continues 0 0 10 0 0 0 0 0 0 4 0 0 0 130 6 0 0 0 4 0 0 0 0 0 6 6 0 0 4 0 4 0 0 0 0 0 10 10 34 0 0 0 0 but the 0's in that list that correspond to 103, 107, 113, 119, 133, 143, 157, 169, 187, 203, 209, are not proved (but if there is a term there, it is more than 500). - Joshua Zucker, May 10 2006
Not only must each nonzero term be >1 (to avoid divisibility by 11), it also cannot equal 2 (mod 3) to avoid divisibility by 3. - Joshua Zucker, May 10 2006

Examples

			The term corresponding to 19 is 7, as 7 concatenation of 91 followed by 19 is the least such prime. (9191919191919119 is a prime).
		

Crossrefs

Cf. A110408.

Extensions

More terms from Joshua Zucker, May 10 2006
Edited by T. D. Noe, Oct 30 2008

A260874 Smallest prime of the form p//r//p//r//p//r// ...., where p = prime(n), r = A004086(p) and // denotes concatenation.

Original entry on oeis.org

1331133113, 17711771177117711771177117711771177117711771177117711771177117711771177117, 19911991199119, 23322332233223322332233223322332233223322332233223322332233223322332233223322332233223322332233223322332233223322332233223, 2992299229, 31133113311331
Offset: 6

Views

Author

Felix Fröhlich, Aug 02 2015

Keywords

Crossrefs

Programs

  • PARI
    a(n) = p=prime(n); r=eval(concat(Vecrev(Str(p)))); s=eval(Str(p, r)); i=0; while(!ispseudoprime(s), if(i%2==0, s=eval(Str(s, p)); i++, s=eval(Str(s, r)); i++)); s
Showing 1-2 of 2 results.