OFFSET
1,2
COMMENTS
a(n) is prime for n in A156585. Conjecture: gpf(a(n)) = gpf(Phi(n,2^n)), where Phi(n,2^n) = A070526(n). - Thomas Ordowski, Feb 16 2014
The conjecture fails at n = 26, where 3340762283952395329506327023033 > 215656329382891550920192462661. Next counterexample for n = 30, but no odd counterexamples found so far. - Charles R Greathouse IV, Feb 17 2014
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 1..50
FORMULA
a(n) = Sum_{k=1..n} 2^((n-k)*n). - Enrique Pérez Herrero, Feb 23 2009
MAPLE
a:=n->(2^(n^2)-1)/(2^n-1): seq(a(n), n=1..13);
MATHEMATICA
f[n_] := (2^(n^2) - 1)/(2^n - 1); Array[f, 12]
F[n_] := Plus @@ Table[2^((n - i)*n), {i, 1, n}] (* Enrique Pérez Herrero, Feb 23 2009 *)
Table[(2^(n^2) - 1)/(2^n - 1), {n, 1, 20}] (* Vincenzo Librandi, Feb 18 2014 *)
PROG
(PARI) a(n)=(2^n^2-1)/(2^n-1) \\ Charles R Greathouse IV, Feb 17 2014
CROSSREFS
KEYWORD
nonn
AUTHOR
Leroy Quet, Apr 19 2007
EXTENSIONS
More terms from Robert G. Wilson v and Emeric Deutsch, Apr 22 2007
STATUS
approved