Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063401
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063401 a(n)=a(n-1)*a(n-2)*a(n-3) with a(0)=1, a(1)=2, a(2)=2. +0
3
1, 2, 2, 4, 16, 128, 8192, 16777216, 17592186044416, 2417851639229258349412352, 713623846352979940529142984724747568191373312, 30354201441027016733116592294117482916287606860189680019559568902170379456331382\ 784 (list; graph; listen)
OFFSET

0,2

LINKS

Harry J. Smith, Table of n, a(n) for n=0,...,15

FORMULA

a(n) =2^A000073(n).

EXAMPLE

a(6)=128*16*4=8192.

PROGRAM

(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) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 20 2009]

CROSSREFS

Cf. A000301, A000308.

Sequence in context: A032318 A090753 A091788 this_sequence A165420 A129614 A070283

Adjacent sequences: A063398 A063399 A063400 this_sequence A063402 A063403 A063404

KEYWORD

nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Jul 16 2001

EXTENSIONS

Definition corrected to a(1)=2, by Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 20 2009

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 21 21:21 EST 2009. Contains 167310 sequences.


AT&T Labs Research