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.
%I A067932 #12 Jun 24 2014 01:08:22 %S A067932 3,5,13,29,61,509,1021,4093,16381,1048573,4194301,16777213,536870909, %T A067932 19807040628566084398385987581,83076749736557242056487941267521533, %U A067932 5316911983139663491615228241121378301 %N A067932 Primes p such that p+3 == 0 (mod phi(p+3)). %C A067932 phi(n) divides n iff n=1 or n=2^w*3^u for w>=1 and u>=0 (see A007694). Such an n can only have the form p+3 if n=6 or n is a power of 2. So the terms of the sequence are 3 and the primes of the form 2^n-3, listed in A050415. %H A067932 Vincenzo Librandi, <a href="/A067932/b067932.txt">Table of n, a(n) for n = 1..30</a> %t A067932 Prepend[Select[2^Range[2, 200]-3, PrimeQ], 3] %K A067932 easy,nonn %O A067932 1,1 %A A067932 _Benoit Cloitre_, Feb 22 2002 %E A067932 Edited and extended by _Robert G. Wilson v_, Feb 27 2002 and by _Dean Hickerson_, Mar 21 2002