From mouse@collatz.mcrcim.mcgill.edu  Sun Aug 21 06:33:13 1994
Return-Path: <mouse@collatz.mcrcim.mcgill.edu>
Received: from Collatz.McRCIM.McGill.EDU by life.ai.mit.edu (4.1/AI-4.10) for /com/archive/cube-lovers id AA29591; Sun, 21 Aug 94 06:33:13 EDT
Received: (root@localhost) by 6700 on Collatz.McRCIM.McGill.EDU (8.6.8.1 Mouse 1.0) id GAA06700 for Cube-Lovers@ai.mit.edu; Sun, 21 Aug 1994 06:33:02 -0400
Date: Sun, 21 Aug 1994 06:33:02 -0400
From: der Mouse <mouse@collatz.mcrcim.mcgill.edu>
Message-Id: <199408211033.GAA06700@Collatz.McRCIM.McGill.EDU>
To: Cube-Lovers@ai.mit.edu
Subject: Re: Updated Upper Limits, Q-turns

> Dan's recursion formula is:

>>   P[n]  <= 4*2*P[n-1] + 6*2*P[n-2] + 4*2*P[n-3] + 1*2*P[n-4]

> Dan's calculations:

>> P[0]  =           1
>> P[1]  =          12
>> P[2]  =         114
>> P[3]  =       1,068
>> P[4]  =      10,011

Ummm.  4*2*P[4-1] + 6*2*P[4-2] + 4*2*P[4-3] + 1*2*P[4-4] =
       4*2*1068 + 6*2*114 + 4*2*12 + 1*2*1 = 10010 < P[4].

What have I missed?  Is Dan's formula not valid until n=5 or something?

					der Mouse

			    mouse@collatz.mcrcim.mcgill.edu