The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A063401 a(n) = a(n-1)*a(n-2)*a(n-3) with a(0)=1, a(1)=2, a(2)=2. 4
 1, 2, 2, 4, 16, 128, 8192, 16777216, 17592186044416, 2417851639229258349412352, 713623846352979940529142984724747568191373312, 30354201441027016733116592294117482916287606860189680019559568902170379456331382784 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Harry J. Smith, Table of n, a(n) for n=0,...,15 FORMULA a(n) = 2^A000073(n+1). EXAMPLE a(6) = 128*16*4 = 8192. MATHEMATICA a0=1; a1=1; a2=2; lst={a0, a1, a2}; Do[AppendTo[lst, a=a0*a1*a2]; a0=a1; a1=a2; a2=a, {n, 12}]; lst (* Vladimir Joseph Stephan Orlovsky, Nov 18 2009 *) RecurrenceTable[{a[0]==1, a[1]==a[2]==2, a[n]==a[n-1]a[n-2]a[n-3]}, a, {n, 12}] (* Harvey P. Dale, Sep 05 2021 *) PROG (PARI) { for (n = 0, 15, if (n>2, a=a1*a2*a3; a3=a2; a2=a1; a1=a, if (n==0, a=a3=1; a1=a2=2, a=2)); write("b063401.txt", n, " ", a) ) } \\ Harry J. Smith, Aug 20 2009 CROSSREFS Cf. A000301, A000308. Sequence in context: A032318 A090753 A091788 * A168088 A168089 A165420 Adjacent sequences:  A063398 A063399 A063400 * A063402 A063403 A063404 KEYWORD nonn AUTHOR Henry Bottomley, Jul 16 2001 EXTENSIONS Definition corrected to a(1)=2 by Harry J. Smith, Aug 20 2009 STATUS approved

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

Last modified December 3 18:19 EST 2021. Contains 349467 sequences. (Running on oeis4.)