Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A051154
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A051154 Numbers of the form 1 + 2^k + 4^k with k=3^n. +0
5
7, 73, 262657, 18014398643699713, 5846006549323611672814741748716771307882079584257 (list; graph; listen)
OFFSET

0,1

COMMENT

The first three terms are prime. Are there more? Golomb shows that k must be a power of 3 in order for 1 + 2^k + 4^k to be prime. - T. D. Noe (noe(AT)sspectra.com), Jul 16 2008

REFERENCES

Walter Feit, Finite projective planes and a question about primes, Proc. AMS, Vol. 108(1990), 561-564.

Solomon W. Golomb, Cyclotomic polynomials and factorization theorems, Amer. Math. Monthly 85 (1978), 734-737.

FORMULA

(2^3^(n+1)-1)/(2^3^n-1).

MAPLE

with(numtheory); F := proc(n, r) local p; p := ithprime(r); (2^(p^(n+1))-1)/(2^(p^n)-1); end; [ seq(F(n, 2), n=0..5) ];

CROSSREFS

Cf. A051155-A051157.

Sequence in context: A048174 A058350 A134281 this_sequence A106427 A106417 A137141

Adjacent sequences: A051151 A051152 A051153 this_sequence A051155 A051156 A051157

KEYWORD

nonn,easy

AUTHOR

njas

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research