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.

A214791 Numbers n such that n+8 = A214789(n).

This page as a plain text file.
%I A214791 #15 Nov 26 2014 09:22:44
%S A214791 17,23,26,37,53,67,83,137,157,163,167,173,193,197,223,283,293,367,373,
%T A214791 383,467,487,523,547,577,613,643,673,683,727,787,853,863,887,907,937,
%U A214791 1033,1063,1093
%N A214791 Numbers n such that n+8 = A214789(n).
%C A214791 This sequence is disjoint from A214790. It is only a conjecture that this sequence consists of primes except for 26.
%H A214791 Charles R Greathouse IV, <a href="/A214791/b214791.txt">Table of n, a(n) for n = 1..4000</a>
%o A214791 (PARI) is(n)=my(k); while(((Mod([1, 1; 1, 0], n))^k++)[1, 2]!=-8, ); k==n+7 \\ _Charles R Greathouse IV_, Nov 25 2014
%Y A214791 Cf. A214789, A214790, A214792
%K A214791 nonn
%O A214791 1,1
%A A214791 _Art DuPre_, Aug 03 2012