The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A152121 a(0) = 4; for n>0, a(n) = a(n-1)^2 - 2^(1+2^(n-1)) 1
 4, 12, 136, 18464, 340918784, 116225617283907584, 13508394113025357323362163662782464, 182476711512818130204254420972394401125552102555370860811711166808064 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS A subset of A056236, where a(n) = (2+sqrt(2))^n+(2-sqrt(2))^n, when the exponent n is a nonnegative integer power of 2. I.E.: a(0) = (2+sqrt(2))^(2^0)+(2-sqrt(2))^(2^0), a(1) = (2+sqrt(2))^(2^1)+(2-sqrt(2))^(2^1); a(2) = (2+sqrt(2))^(2^2)+(2-sqrt(2))^(2^2); etc. For all n the value 2^(n+1) can be factored from each a(n), which except for a different initial term (a(0) = 2 instead of a(0) = 1) matches the sequence A001601 for n>0. LINKS Dennis Martin, Table of n, a(n) for n = 0..10 FORMULA a(n) = a(n-1)^2 - 2^(1+2^(n-1)) EXAMPLE a(0) = 4; a(1) = 4^2 - 2^2 = 12; a(2) = 12^2 - 2^3 = 136; a(3) = 136^2 - 2^5 = 18464; a(4) = 18464^2 - 2^9 = 340918784. CROSSREFS Cf. A056236, A001601 Sequence in context: A002029 A204321 * A077611 A052598 A230691 A032071 Adjacent sequences: A152118 A152119 A152120 * A152122 A152123 A152124 KEYWORD easy,nonn AUTHOR Dennis Martin (dennis.martin(AT)dptechnology.com), Nov 24 2008 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 9 20:47 EST 2023. Contains 367695 sequences. (Running on oeis4.)