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.

A181636 Primes of form (2^n + 3^n)/13.

This page as a plain text file.
%I A181636 #6 Mar 30 2012 18:35:54
%S A181636 61,4621,369181,2414250301,1282861452271981,103911691734684541,
%T A181636 102329189594547549657540565413396038701,
%U A181636 28900785585664327723593061693364968422740414514061,7915715496579381803076374342089862963295414837600820914397695027296168074652778681081092369443226449741
%N A181636 Primes of form (2^n + 3^n)/13.
%C A181636 Numbers n such that (2^n + 3^n)/13 is prime are listed in A181628 = {6, 10, 14, 22, 34, 38, 82, 106, 218, 334, 4414 , ...}.
%F A181636 a(n) = (2^A181628(n) + 3^A181628(n))/13.
%e A181636 4621 is in the sequence because (2^10+ 3^10)/13 = 60073/13 = 4621 is
%e A181636   prime.
%p A181636 with(numtheory):for n from 1 to 350 do: x:= (2^n + 3^n)/13:if floor(x)=x and
%p A181636   type(x,prime)=true then printf(`%d, `, x):else fi:od:
%Y A181636 Cf. A181628
%K A181636 nonn
%O A181636 1,1
%A A181636 _Michel Lagneau_, Nov 18 2010