Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A139474
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A139474 a(n)=((2*Sqrt[2] + 3)^(2^(Prime[n] - 1) - 1) - (3 - 2*Sqrt[2])^(2^(Prime[n] - 1) - 1))/(4*Sqrt[2]). +0
5
1, 35, 53789260175, 300027707381709879256191290532493317737977820735 (list; graph; listen)
OFFSET

1,2

COMMENT

Next term a(5) has 783 decimal digits

Conjecture of Kenneth J. Ramsey (RamseyKK2(AT)aol.com) from May 16 2006 (see A001109): a(n) is divisible by 2^Prime[n]-1 if and only 2^Prime[n]-1 is Mersenne prime

MATHEMATICA

Table[Expand[((2*Sqrt[2] + 3)^(2^(Prime[n] - 1) - 1) - (3 - 2*Sqrt[2])^(2^(Prime[n] - 1) - 1))/(4*Sqrt[2])], {n, 1, 10}] (*Artur Jasinski*)

CROSSREFS

Cf. A001109, A139474, A139475, A139476.

Sequence in context: A110596 A126029 A107736 this_sequence A023929 A010113 A167264

Adjacent sequences: A139471 A139472 A139473 this_sequence A139475 A139476 A139477

KEYWORD

nonn

AUTHOR

Artur Jasinski (grafix(AT)csl.pl), Apr 22 2008

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research