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.

A222265 Numbers n such that (13^n + 2^n)/15 is prime.

This page as a plain text file.
%I A222265 #57 Jul 29 2013 12:02:05
%S A222265 7,31,103,223,503,1171,1973,4111,4729
%N A222265 Numbers n such that (13^n + 2^n)/15 is prime.
%C A222265 All terms are prime.
%C A222265 a(10) > 10^5.
%t A222265 Select[Prime[Range[1, 100000]], PrimeQ[(13^# + 2^#)/15]&]
%o A222265 (PARI) forprime(p=3,10^6, if(ispseudoprime((13^p + 2^p)/15), print1(p,", ") ) ); \\ _Joerg Arndt_, Jul 29 2013
%Y A222265 Cf. A125956, A125957, A057159, A128071, A213176.
%K A222265 nonn,hard,more
%O A222265 1,1
%A A222265 _Robert Price_, May 05 2013
%E A222265 Removed incorrect first term of "2".