A121451 Maximum product over partitions into parts of the form 3k+2.

0, 2, 0, 4, 5, 8, 10, 16, 20, 32, 40, 64, 80, 128, 160, 256, 320, 512, 640, 1024, 1280, 2048, 2560, 4096, 5120, 8192, 10240, 16384, 20480, 32768, 40960, 65536, 81920, 131072, 163840, 262144, 327680, 524288, 655360, 1048576

Offset

1,2

Comments

With the exception of the first three terms of this sequence and the first two terms of A094958, these two sequences appear to be identical.

Links

Table of n, a(n) for n=1..40.

Formula

Conjecture. a(1)=a(3)=0, otherwise a(n)=2^(n/2) if n is even and a(n)=5*2^((n-5)/2) if n is odd. (This has been verified for up to n=40.)

Example

The only partition of 7 into parts of the form 3k+2 is {5,2}, so the maximum product is a(7)=10.

Crossrefs

Cf. A000792, A034893, A094958.

Sequence in context: A049271 A004178 A068333 * A265820 A096984 A213723

Adjacent sequences: A121448 A121449 A121450 * A121452 A121453 A121454

Keyword

nonn

Author

John W. Layman, Apr 26 2007

Status

approved