This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A121451 #7 Mar 30 2012 17:37:54
%S A121451 0,2,0,4,5,8,10,16,20,32,40,64,80,128,160,256,320,512,640,1024,1280,
%T A121451 2048,2560,4096,5120,8192,10240,16384,20480,32768,40960,65536,81920,
%U A121451 131072,163840,262144,327680,524288,655360,1048576
%N A121451 Maximum product over partitions into parts of the form 3k+2.
%C A121451 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.
%F A121451 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.)
%e A121451 The only partition of 7 into parts of the form 3k+2 is {5,2}, so the maximum product is a(7)=10.
%Y A121451 Cf. A000792, A034893, A094958.
%K A121451 nonn
%O A121451 1,2
%A A121451 _John W. Layman_, Apr 26 2007