login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A152578
a(n) = 5^(2^(n-1)) + 2.
1
7, 27, 627, 390627, 152587890627, 23283064365386962890627, 542101086242752217003726400434970855712890627
OFFSET
1,1
COMMENTS
Except for the first term, these numbers are divisible by 3. This follows from the identity I: a^n-b^n = (a+b)(a^(n-1) - a^(n-2)b + ... + b^(n-1)) for odd values of n. In this example, by expanding the binomial (3+2)^(2^n)+2, we get 3h + 2^(2^n)+2 for some h. Now 2^(2^n)+2 = 2*(2^(2^n-1)+1). Since 2^n-1 is odd, by identity I, 3 divides 2^(2^n)+2 + 3h. Therefore 3 divides 5^(2^n)+2 for n > 0.
PROG
(PARI) a(n) = 5^(2^(n-1)) + 2
CROSSREFS
Sequence in context: A033910 A196647 A274579 * A300529 A299468 A200974
KEYWORD
nonn,easy
AUTHOR
Cino Hilliard, Dec 08 2008
STATUS
approved