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 A136474 #4 Mar 31 2012 20:17:54
%S A136474 3,19,163,1459,17497,52489,87211,135433,139483,1220347,5419387,
%T A136474 6049243,28934011,86093443,227862073,272010961
%N A136474 Primes that divide 2^(3^n)+1 for some n.
%C A136474 This sequence is a subsequence of A057719.
%C A136474 272010961 is the last term less than 3*10^9. The n for each prime is 0, 2, 4, 5, 7, 8, 3, 4, 5, 9, 7, 7, 8, 16, 6, 4. Some terms from A111974 are in this sequence also: 411782264189299, 116299474006080119380780339, and 84782316550432407028588866403. If p=2*3^k+1 is prime for an even k, then p is in this sequence.
%e A136474 1220347 belongs to the sequence as it is a factor of 2^(3^9)+1 (This is the largest member of the sequence less than 5000000)
%p A136474 with(numtheory):L:=3;for p from 5 to 5000000 do if isprime(p) then q:=op(2,ifactors(order(2,p)));if nops(q)=2 then if op(1,op(1,q))=2 and op(2,op(1,q))=1 and op(1,op(2,q))=3 then L:=L,p;fi;fi;fi;od;L;
%t A136474 Reap[Do[p=Prime[n]; mo=MultiplicativeOrder[2, p]; If[EvenQ[mo] && IntegerQ[Log[3,mo/2]], Sow[p]], {n, PrimePi[10^7]}]][[2,1]]
%Y A136474 Cf. A057719, A136475, A005621, A136473.
%K A136474 more,nonn
%O A136474 1,1
%A A136474 _Christopher J. Smyth_, Feb 16 2008