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.

A214288 Primes of the form phi(n)+1 sorted by increasing n, where phi is the Euler totient function.

This page as a plain text file.
%I A214288 #24 Jul 17 2012 02:35:00
%S A214288 2,2,3,3,5,3,7,5,7,5,11,5,13,7,17,7,19,13,11,23,13,19,13,29,31,17,17,
%T A214288 13,37,19,17,41,13,43,23,47,17,43,53,19,41,37,29,59,17,61,31,37,67,71,
%U A214288 73,37,41,37,61,79,41,83,43,41,89,73,61,47,73,97,43,61,41,101,103,53,107,37
%N A214288 Primes of the form phi(n)+1 sorted by increasing n, where phi is the Euler totient function.
%C A214288 Primes in A039649.
%C A214288 All primes are in the sequence.
%H A214288 Vincenzo Librandi, <a href="/A214288/b214288.txt">Table of n, a(n) for n = 1..1000</a>
%t A214288 Select[Table[EulerPhi[n]+1,{n,1,1000}],PrimeQ]
%Y A214288 Cf. A000010, A039698 (associated n), A214287.
%K A214288 nonn,easy
%O A214288 1,1
%A A214288 _Vincenzo Librandi_, Jul 13 2012