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.

A056246 Indices of primes in sequence defined by A(0) = 11, A(n) = 10*A(n-1) + 41 for n > 0.

Original entry on oeis.org

0, 1, 3, 19, 31, 399, 561, 7015, 37683
Offset: 1

Views

Author

Robert G. Wilson v, Aug 18 2000

Keywords

Comments

Numbers n such that (140*10^n - 41)/9 is a prime.
Numbers n such that digit 1 followed by n >= 0 occurrences of digit 5 followed by digit 1 is a prime.
Numbers corresponding to terms <= 561 are certified primes.

Examples

			151 is a prime, hence 1 is a term.
		

References

  • Klaus Brockhaus and Walter Oberschelp, Zahlenfolgen mit homogenem Ziffernkern, MNU 59/8 (2006), pp. 462-467.

Crossrefs

Programs

  • Mathematica
    Select[Range[0, 2000], PrimeQ[(140 10^# - 41) / 9] &] (* Vincenzo Librandi, Nov 03 2014 *)
  • PARI
    a=11;for(n=0,1500,if(isprime(a),print1(n,","));a=10*a+41)
    
  • PARI
    for(n=0,1500,if(isprime((140*10^n-41)/9),print1(n,",")))

Formula

a(n) = A082699(n-1) - 2 for n > 1.

Extensions

Additional comments from Klaus Brockhaus and Walter Oberschelp (oberschelp(AT)informatik.rwth-aachen.de), Dec 28 2004
Edited by N. J. A. Sloane, Jun 15 2007
More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Jan 02 2008
Added and updated a link, by Patrick De Geest, Nov 02 2014
Edited by Ray Chandler, Nov 04 2014